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

arr=[0,len(s)+1]

for i in range(0,len(s)):
    if(s[i]=='*'):
        arr.append(i)
arr.sort();
minx=0
for k1 in range(0,len(arr)):
    if(arr[k1]==0):
        test='('
    else:
        test=s[0:arr[k1]+1]+'('
    for k2 in range(k1+1,len(arr)):
        tt=test
        if(arr[k1]==0):
            tt=tt+s[arr[k1]:arr[k2]]+')'+s[arr[k2]:len(s)]
        else:
            tt=tt+s[arr[k1]+1:arr[k2]]+')'+s[arr[k2]:len(s)]
        exec("a="+tt)
        if(a>minx):
            minx=a;
        #print k1,k2
        #print tt
        
print minx
