PROGRAMMING:Infix expressions are converted to suffix expressions and evaluated

The infix expression given in the title is converted to the output of the suffix expression, and the value of the suffix expression is calculated. For the sake of simplicity, we agree that: 1. The infix expression must be legal and contain only numbers, four operators +, -, *, / and parentheses; 2. The operands are all positive integers (1-9); 3. The infix expression should not exceed 20 characters; 4. The result of the division operation is still a positive integer.
###Input format:
The first line of input is a positive integer n, which means there are n lines below. Each line is an infix expression. For the sake of simplicity, we agree that: 1. The infix expression must be legal and contain only numbers, four operators +, -, *, / and parentheses; 2. The operands are all positive integers (1-9); 3. The infix expression should not exceed 20 characters; 4. The result of the division operation is still a positive integer.
###Output format:
Output the suffix expression corresponding to infix expression in each line. After one space, output the calculated value of the suffix expression.
###Input example:
Here is a set of inputs. For example:
```in
six
2+4
3+2*7
2*(4+6)
(5/2+4)*5+2
(3+5)*(7-2)/4
5*(8-(3+2))
```
###Output example:
The corresponding output is given here. For example:
```out
24+ 6
327*+ 17
246+* 20
52/4+5*2+ 32
35+72-*4/ 10
5832+-* 15
```







answer：If there is no answer, please comment