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

s = raw_input().strip()

if s.count('+') == 1:
	p = s.index('+')
	s = s[:p-1] + '(' + s[p-1:p+2] + ')' + s[p+2:]
	print(eval(s))
else:
	best = eval(s)
	s = '*' + s + '*'
	reg1 = re.compile(r'\*\d\+')
	reg2 = re.compile(r'\+\d\*')
	for m1 in reg1.finditer(s):
		p1 = m1.start()
		for m2 in reg2.finditer(s[m1.start():]):
			p2 = m2.start()
			s1 = s[:p1+1] + '(' + s[p1+1:p1+p2+2] + ')' + s[p1+p2+2:]
			v1 = eval(s1[1:-1])
			if v1 > best:
				best = v1
	print best