Vanya is doing his maths homework. He has an expression of form <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/12fd75e59feeb788ff8b791f7194301b0d005ad6.png" style="max-width: 100.0%;max-height: 100.0%;"/>, where *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> are digits from 1 to 9, and sign <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/5535bcdec4c47f48bc7dcaaf51ba2b5901a202e5.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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.
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.
import math
s="*"
s=s+input()
s=s+"*"
n=len(s)
ans=0
for i in range(0,n):
    if s[i]=='*':
        for j in range(i+1,n-1):
            if s[j+1]=='*':
                a=""
                for k in range(0,n-1):
                    if k>0:
                        a=a+s[k]
                    if k==i:
                        a=a+"("
                    if k==j:
                        a=a+")"
                t=eval(a)
                if t>ans:
                    ans=t
print(ans)
