A warehouse invoicing tool stores each line-item adjustment as a single infix arithmetic expression string. The expression contains only the characters 0-9, +, -, *, /, (, and ), with no whitespace anywhere. Each maximal run of digits is one integer literal (interpreted the usual way, e.g. 007 equals 7); there is no unary plus or minus (every - and + is a binary operator between two sub-expressions).
Evaluate the expression using standard precedence (* and / bind tighter than + and -), left-to-right associativity for operators of equal precedence, and parentheses to override precedence. Division truncates toward zero (like integer division in C or Java), e.g. (2-8)/3 evaluates to -2.
It is guaranteed that the string is a syntactically valid, fully-parenthesizable arithmetic expression and that division by zero never occurs.
Input format
Line 1: the expression string.
Output format
A single integer: the value of the expression.
Constraints
- 1 ≤ length of the expression ≤ 200
- Every integer literal, and every intermediate/final value, fits in a 64-bit signed integer.
- Division by zero never occurs.