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).
def mul2val(s):
    res = 1
    for i in s.split('*'): res *= int(i)
    return res

s = '1*' + input() + '*1'
muls = s.split('+')

vals = list(map(mul2val, muls))
lvals = list(map(mul2val, [mul[:-2] if len(mul)>1 else '0'
                           for mul in muls]))
rvals = list(map(mul2val, [mul[2:] if len(mul)>1 else '0'
                           for mul in muls]))

cumvals = [0] + vals
for i in range(1,len(cumvals)): cumvals[i] += cumvals[i-1]

total = cumvals[-1]
ans = total

for i,mul1 in enumerate(muls):
    if len(mul1)==1: continue
    for j,mul2 in enumerate(muls[i+1:],i+1):
        if len(mul2)==1: continue

        tval = (cumvals[i]
                + lvals[i] * (int(mul1[-1])
                              + (cumvals[j] - cumvals[i+1])
                              + int(mul2[0]))
                           * rvals[j]
                + (total-cumvals[j+1]))
        if tval > ans: ans = tval

print(ans)
