Vanya is doing his maths homework. He has an expression of form <image>, where x1, x2, ..., xn are digits from 1 to 9, and sign <image> represents either a plus '+' or the multiplication sign '*'. Vanya needs to add one pair of brackets in this expression so that to maximize the value of the resulting expression.

Input

The first line contains expression s (1 ≤ |s| ≤ 5001, |s| is odd), its odd positions only contain digits from 1 to 9, and even positions only contain signs  +  and  * . 

The number of signs  *  doesn't exceed 15.

Output

In the first line print the maximum possible value of an expression.

Examples

Input

3+5*7+8*4


Output

303


Input

2+3*5


Output

25


Input

3*4*5


Output

60

Note

Note to the first sample test. 3 + 5 * (7 + 8) * 4 = 303.

Note to the second sample test. (2 + 3) * 5 = 25.

Note to the third sample test. (3 * 4) * 5 = 60 (also many other variants are valid, for instance, (3) * 4 * 5 = 60).
exp = list(raw_input().split()[0])
ans = 0
index = [-1]
for i in xrange(1, len(exp), 2):
    if exp[i] == "*":
        index.append(i)
index.append(len(exp))
for i in xrange(len(index)-1):
    exp.insert(index[i]+1, "(")
    for j in xrange(i+1, len(index)):
        exp.insert(index[j]+1, ")")
        ans = max(ans, eval("".join(exp)))
        exp.pop(index[j]+1)
    exp.pop(index[i]+1)
print ans