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).
src_str=input()
lenstr=len(src_str)
str=list(src_str)

listMulPos=[]
for i,c in enumerate(str):
    if c=='*':
        listMulPos.append(i)
listLeftParPos=[0]
for i in listMulPos:
    listLeftParPos.append(i+1)
listRightParPos=[lenstr]
for i in listMulPos:
    listRightParPos.append(i)

ans=0

for leftPos in listLeftParPos:
    for rightPos in listRightParPos:
        tmp=[]
        for i in str:
            tmp.append(i)
        if(leftPos<rightPos+1):
            tmp.insert(leftPos,'(')
            tmp.insert(rightPos+1,')')
            tmpval=eval(''.join(tmp))
            ans=max(ans,tmpval)

print(ans)
		 	 		      		  	       			