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.
s1 = input()
res = 0
s = ''
for i in range(len(s1)):
    if s1[i].isalnum() and i > 1:
        if s1[i-1] == '+':
            s = s[:-1]
            t = [x.split('*') for x in s.split('+')]
            t = t[-1][-1]
            s = s[:s.rfind(t)] + str(int(t) + int(s1[i]))
        else:
            s+=s1[i]
    else:
        s+=s1[i]
for i in range(0, len(s)):
    for j in range(i + 1, len(s) + 1):
        r = s[0:i] + '(' + s[i: j] + ')' + s[j:]
        f = 1
        print(r)
        try:
            exec(f"r = {r}")
        except SyntaxError:
            f = 0
        except TypeError:
            f = 0
        except SyntaxWarning:
            pass
        if f and r > res:
            res = r
if len(s) == 1:
    print(s)
else:
    print(res)
