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 main():
    s = raw_input()
    t = []
    t.append(-1)
    for i, p in enumerate(s):
        if p == '*':
            t.append(i)
    t.append(len(s))
    res = eval(s)
    for i in xrange(len(t)):
        for j in xrange(i + 1, len(t)):
            x, y = t[i], t[j]
            ns = s[:x + 1] + '(' + s[x + 1:y] + ')' + s[y:]
            res = max(res, eval(ns))
    print res

if __name__ == '__main__':
    main()
