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).
exp=input()
if exp.count("+")==0:
	print(eval(exp))
elif exp.count("*")==0:
	print(eval(exp))
else:
	maximum=0
	exp="1*" + exp + "*1"
	for index1 in range(0,len(exp)):
		value=0
		if exp[index1:(index1+1)]=="*":
			for index2 in range(index1+1,len(exp)):
				if exp[index2:(index2+1)]=="*":
					value=eval(exp[index1+1:index2])
					sub_exp=exp[0:index1+1] + str(value) + exp[index2:]
					value=eval(sub_exp)
					if value>maximum:
						maximum=value
	print(maximum)