Polish mathematician Jan Łukasiewicz (1878-1956) invented a form of symbolic logic that Hewlett Packard implemented in their calculators shortly after his death. It is a method of entering an equation, different from the "algebraic" method we are now familiar with. In honour of Jan, they named the method RPL or Reverse Polish Logic.

In RPL numbers are entered and pushed down on a stack each time you press the Enter key (`E`

in our examples). As soon as you press a binary operation such as `+`

(add), `-`

(subtract), `*`

(times), `/`

(divide), `!`

(to the power of), that operation is performed on the number in the display and the number on top of the stack. The numbers on the stack are then pushed up one level.

Note that in this problem, `!`

means "to the power of", as in: and . (The `^`

character is a control character in Turing, and cannot be used by those using Turing)

#### Examples

The expression `45E4+`

is algebraically equivalent to :

`45` |
enter into the display |

`E` |
push it on the stack |

`4` |
enter into the display |

`+` |
add the top of the stack () to the display () put in the display |

The expression `25E30E12+*`

is algebraically equivalent to :

`25` |
enter into the display |

`E` |
push it on the stack |

`30` |
enter into the display |

`E` |
push it on the stack ( is pushed further down) |

`12` |
enter into the display |

`+` |
add the top of the stack () to the display () put in the display ( goes back to the top of the stack) |

`*` |
multiply top of the stack () to the display () put in the display |

The input contains RPL expressions, each on a separate line.

There are no variables, only positive numbers, with or without decimal point and the five operations: `+`

, `-`

, `*`

, `/`

, `!`

and `E`

. The expressions contain no spaces and are less than characters in length.

Write a program that will translate the expression to its algebraic equivalent form and solve the expression, as in the sample output below. **Your answers need not be rounded off, and only use brackets where needed.**

#### Sample Input

```
56E34E213.7+*678-
1E56E35+16E9-/+
1E3+
13E2!5E2!-
123E
```

#### Sample Output

```
56 * (34 + 213.7) - 678 = 13193.2
1 + (56 + 35) / (16 - 9) = 14
1 + 3 = 4
13 ! 2 - 5 ! 2 = 144
123 = 123
```

Educational Computing Organization of Ontario - statements, test data and other materials can be found at ecoocs.org

## Comments

Can anyone check whats wrong with my code? it works for the sample testcase and the first testcase, but fails some of the second and third testcase. Thanks in advance :)

java.lang.NullPointerException when submitting the same AC code?