PROGRAMMING:Suffix evaluation (one bit integer operands version)
We humans are used to writing infixes, such as' 3 + 5 * 2 ', whose value is' 13'( p. Why do people get used to infix? Is it because infixes are easier to use than suffixes
Computers are more used to "reverse Polish notation". The suffixes corresponding to the above infixes are: ` 3 5 2 *+`
Now, evaluate the input suffix. In order to simplify the input processing and operation, the number of operands (operands) is not more than '300' and they are all 1-bit positive integers. There are only four kinds of operators (operators), '+ - * /' (addition, subtraction, multiplication and division). There is no space between the operands and operators, and the * * topic guarantees that the intermediate result and the final result of the operation are within the integer range * *.
However, note that the suffixes entered in the title may be wrong, for example:
*'1234 + -' error, missing operator
*'123 + - *' error, missing operands
*'122 - /' error, divisor '0`
The above three errors will not happen at the same time.
###Input format:
The first line gives a positive integer k no more than 10;
Next K lines, each line gives a suffix, the format of the suffix is as described above, 1-bit operands and no space interval.
###Output format:
The output has k lines. For each input suffix, judge whether it is correct (evaluable) and output it in one line
*If the suffix is correct and evaluable, the result will be output
*If the divisor is 0, output ` division by zero`
*If other errors are found, output ` expression error`
###Input sample 1:
```in
two
1234+-*
123+4-*
```
###Output sample 1:
```out
-5
one
```
###Input sample 2:
```in
two
12+
1234+-
```
###Output sample 2:
```out
three
Expression Error!
```
###Input sample 3:
```in
two
2222+-*
22+-*
```
###Output sample 3:
```out
-4
Expression Error!
```
###Input sample 4:
```in
one
2222-/+
```
###Output sample 4:
```out
Division By Zero!
```
answer:If there is no answer, please comment
Computers are more used to "reverse Polish notation". The suffixes corresponding to the above infixes are: ` 3 5 2 *+`
Now, evaluate the input suffix. In order to simplify the input processing and operation, the number of operands (operands) is not more than '300' and they are all 1-bit positive integers. There are only four kinds of operators (operators), '+ - * /' (addition, subtraction, multiplication and division). There is no space between the operands and operators, and the * * topic guarantees that the intermediate result and the final result of the operation are within the integer range * *.
However, note that the suffixes entered in the title may be wrong, for example:
*'1234 + -' error, missing operator
*'123 + - *' error, missing operands
*'122 - /' error, divisor '0`
The above three errors will not happen at the same time.
###Input format:
The first line gives a positive integer k no more than 10;
Next K lines, each line gives a suffix, the format of the suffix is as described above, 1-bit operands and no space interval.
###Output format:
The output has k lines. For each input suffix, judge whether it is correct (evaluable) and output it in one line
*If the suffix is correct and evaluable, the result will be output
*If the divisor is 0, output ` division by zero`
*If other errors are found, output ` expression error`
###Input sample 1:
```in
two
1234+-*
123+4-*
```
###Output sample 1:
```out
-5
one
```
###Input sample 2:
```in
two
12+
1234+-
```
###Output sample 2:
```out
three
Expression Error!
```
###Input sample 3:
```in
two
2222+-*
22+-*
```
###Output sample 3:
```out
-4
Expression Error!
```
###Input sample 4:
```in
one
2222-/+
```
###Output sample 4:
```out
Division By Zero!
```
answer:If there is no answer, please comment