PROGRAMMING:Expression tree bracket
Please write a program to output the expression tree as infix expression, and fill in the necessary brackets. The brackets should not be redundant, that is, the minimum brackets required to ensure the correct operation order. For example, brackets in $$a * (B + C) $$and $$a + (B-C) $$are necessary, while brackets in $$a + (b * c) $$are redundant. It is assumed that all operations in the expression tree are binary operations, involving only addition, subtraction, multiplication and division.
###Input format:
The input is a string, which represents the first root sequence of the expression tree with null pointer information. The null pointer information is represented by #, the operands are lowercase letters of A-Z, and the operators are +, -, *, /.
###Output format:
The output is a line of string, which indicates infix expression with necessary brackets.
###Input sample 1:
```in
*a##+b##c##
```
###Output sample 1:
```out
a*(b+c)
```
###Input sample 2:
```in
+a##*b##c##
```
###Output sample 2:
```out
a+b*c
```
answer：If there is no answer, please comment
###Input format:
The input is a string, which represents the first root sequence of the expression tree with null pointer information. The null pointer information is represented by #, the operands are lowercase letters of A-Z, and the operators are +, -, *, /.
###Output format:
The output is a line of string, which indicates infix expression with necessary brackets.
###Input sample 1:
```in
*a##+b##c##
```
###Output sample 1:
```out
a*(b+c)
```
###Input sample 2:
```in
+a##*b##c##
```
###Output sample 2:
```out
a+b*c
```
answer：If there is no answer, please comment