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 = raw_input()

s = "1*" + s + "*1"

def mul(s):
    ans = 1
    l = map(int,s.split("*"))
    for i in l:
        ans = ans*i
    return ans

def calc(s):
    if s == '':
        return 0
    return sum(map(mul,s.split("+")))

l = s.split("*")

ans = 0

# print l

for i in xrange(len(l)):
    for j in xrange(i,len(l)):
        x = calc("*".join(l[i:j]))
        ss = "*".join(l[:i]) +  "*" +  str(x) + "*" + "*".join(l[j:])
        if ss[0] == "*":
            ss = ss[1:]
        if ss[-1] == "*":
            ss = ss[:-1]
        #print ss
        ans = max(ans,calc(ss))

print ans