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.
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)
		 	   		 		 	      			  		   	