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: Hemanth Kumar Veeranki
    Handle:harry7

"""
#!/usr/bin/python
inp=raw_input()
ans=0
a=[]
n=len(inp)
for i in xrange(n):
    if inp[i]=='*':
        a.append(i)
n=len(a)
for i in xrange(n):
    for j in xrange(i):
        tmp=inp[:a[i]] + ')' + inp[a[i]:]
        tmp=tmp[:a[j]+1] + '(' + tmp[a[j]+1:]
        ans=max(ans,eval(tmp))
    tmp=inp[:a[i]]+')'+inp[a[i]:]
    tmp='('+tmp
    ans=max(ans,eval(tmp))
    for j in xrange(i+1,n):
        tmp=inp[:a[i]+1] + '(' + inp[a[i]+1:]
        tmp=tmp[:a[j]+1] + ')' + tmp[a[j]+1:] 
        ans=max(ans,eval(tmp))  
    tmp=inp[:a[i]+1]+'('+inp[a[i]+1:]
    tmp=tmp+')'
    ans=max(ans,eval(tmp))
ans=max(ans,eval(inp))
print ans
