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.
s = input()
s = "1*" + s + "*1"
lx = len(s)
rep = eval(s)
pos = []
for i in range(lx):
    if s[i] == "*":
        pos.append(i)

sz = len(pos)
for aa1 in range(sz):
    for aa2 in range(aa1+1, sz):
        a1 = pos[aa1]
        a2 = pos[aa2]
        ns = ""
        for i in range(lx):
            if i == a2:
                ns += ")"
            ns += s[i]
            if i == a1:
                ns += "("
        rep = max(rep, eval(ns))

print(rep)