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).
s = input()

processed = True
i1 = 1
while i1 < len(s):
    while i1 < len(s):
        if s[i1] == '+':
            break
        i1 += 2
    if i1 >= len(s):
        break
    i2 = i1 + 2
    while i2 < len(s):
        if s[i2] == '*':
            break
        i2 += 2

    i2 = i2 - 2
    if i2 - i1 > 2:
        s1 = eval(s[i1+1: i2])
        s = s[:i1+1] + str(s1) + s[i2:]
        i1 += 4
    else:
        i1 += 2

mults = [-1]
for i in range(len(s)):
    if s[i] == '*':
        mults.append(i)

mults.append(len(s))
max = 0
for i in range(len(mults)):
    for j in range(i+1, len(mults)):
        news =  s[:mults[i]+1] + '(' + s[mults[i]+1:mults[j]] + ')' +s[mults[j]:]
        v = eval(news)
        if v > max:
            max = v
print(max)
