Instead of computer science lessons, boy Vasya was engaged in preparing for programming contests and achieved great success in this. Unfortunately, as a result of constant training, Vasya began to think "inside the box." For example, after seeing the task below, Vasya thought: “Hmm, strange, where are the restrictions? Okay, I will write a long arithmetic, it will pass. So, what to choose? Reverse Polish notation or recursive analysis of the expression? ...”. Of course, the task is solved much easier than Vasya thinks, but for this you need to think outside the box. And the limitations can be found by looking at the input file that is attached to the condition.
The task is formulated as follows: You are given a set of correct arithmetic expressions that use integers, mathematical operations +, - and ∗, and parentheses. Each expression begins with the = sign. For each of the expressions, calculate the result of the calculation.
Here is the input file. He himself was looking for some kind of trick in the task, which greatly simplifies the solution, but he did not find it. I understand that it is possible to use the arrester itself, about which it is stated in the condition, but the task should be solved somehow easier - this is clearly indicated.