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).
from fractions import gcd
import sys

def solve():
    s = input()
    res = eval(s)
    for l in range(-1, len(s)):
        if s[l] == '*' or l == -1:
            for r in range(l + 2, len(s) + 1, 2):
                if r == len(s) or s[r] == '*':
                    temp = s[:l + 1] + '(' + s[l + 1 : r] + ')' + s[r : ]
                    try: res = max(res, eval(temp))
                    except: pass
    print(res)
    
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
solve()