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).
__author__ = 'yesh233'


def gao2(x, y, l, r):
    y *= a[l]
    for i in range(l, r):
        if e[i] == '*':
            y *= a[i + 1]
        else:
            x, y = x + y, a[i + 1]
    return x, y


def gao(l, r):
    lx, ly = gao2(0, 1, 0, l)
    cx, cy = gao2(0, 1, l + 1, r)
    rx, ry = lx, ly * (cx + cy)
    return sum(gao2(rx, ry, r + 1, len(a)-1))


s = raw_input()
s = '1*'+s+'*1'
# print s
e = [s[i] for i in range(1, len(s), 2)]
a = [int(s[i]) for i in range(0, len(s), 2)]
pe = filter(lambda i: e[i] == '*', range(len(e)))
ans = max([gao(pe[i], pe[j]) for j in range(len(pe)) for i in range(j)])
print ans