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.
s=input()
n=len(s)
ans=eval(s)
for i in range(0,n):
	for j in range(i+1,n):
		if s[i]=='*' and s[j]=='*':
			e=s[0:i+1]+'('+s[i+1:j]+')'+s[j:]
			ans=max(ans,eval(e))
for i in range(0,n):
	if s[i]=='*':
		e='('+s[0:i]+')'+s[i:]
		ans=max(ans,eval(e))
		e=s[0:i+1]+'('+s[i+1:]+')'
		ans=max(ans,eval(e))
print(ans)
  		 			 	  	 		 		 	 	      	