Vanya is doing his maths homework. He has an expression of form <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/12fd75e59feeb788ff8b791f7194301b0d005ad6.png" style="max-width: 100.0%;max-height: 100.0%;"/>, where *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> are digits from 1 to 9, and sign <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/5535bcdec4c47f48bc7dcaaf51ba2b5901a202e5.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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.
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.
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) - 1, 2):
    if exp[i] == '*':
      pos.append(i)
  pos.append(len(exp))
  for i in range(0, len(pos) - 1):
    for j in range(i + 1, len(pos) - 1):
      res = max(res, f2(exp, pos[i] + 1, pos[j] - 1))
  return res

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