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).
str = '1*' + input() + '*1'
n = len(str)

max_z = eval(str)
arr = []

for i in range(1, n, 2):
	if str[i] == '*':
		arr.append(i)

for i in range(len(arr)):
	s1 = str[:arr[i]+1] + '(' + str[arr[i]+1:]
	for j in range(i + 1, len(arr)):
		s2 = s1[:arr[j]+1] + ')' + s1[arr[j]+1:]
		max_z = max(eval(s2), max_z)

print(max_z)		