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 sys

def f2(exp: str, index1: int, index2: int):
  return eval(exp[: index1] + '(' + exp[index1: index2 + 1] + ')' + exp[index2 + 1:])

def f1(exp: str):
  res, pos = eval(exp), [-1]
  for i in range(1, len(exp), 2):
    if exp[i] == '*':
      pos.append(i)
  pos.append(len(exp))
  for i in range(0, len(pos)):
    for j in range(i + 1, len(pos)):
      res = max(res, f2(exp, pos[i] + 1, pos[j] - 1))
  return res

for line in sys.stdin:
  print(f1(line))
