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).
tmp = raw_input().split('+')
tlen = len(tmp)
newstr = []
z = 0
while(z < tlen):
	if(len(tmp[z])==1):
		tempans = 0
		while(z < tlen and len(tmp[z])==1):
			tempans += int(tmp[z])
			z += 1
		newstr.append(str(tempans))
	else:
		newstr.append(tmp[z])
		z += 1

original = "+".join(newstr)
orlen = len(original)
fanswer = -1

for x in xrange(0,orlen):
	if(x != 0):
		if(original[x-1] not in ['+','*']):
			continue
	for y in xrange(x,orlen):
		if(y != orlen-1):
			if(original[y+1] not in ['+','*']):
				continue
		answer = eval(original[0:x]+'('+str(eval(original[x:y+1]))+')'+original[y+1:])
		if(answer > fanswer):
			fanswer = answer

print fanswer