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.
# coding: utf-8
expr = list(input())
mul_pos = [-1]
add_cnt = [0] * len(expr)
for i, _ in enumerate(expr):
    add_cnt[i] = add_cnt[i - 1]  # don't worry about add_cnt[-1] ;)
    if _ == '*':
        mul_pos.append(i)
    elif _ == '+':
        add_cnt[i] += 1
mul_pos.append(len(expr))
add_cnt.append(add_cnt[-1])
add_cnt.append(0)
ans = 0
for i in range(len(mul_pos)):
    for j in range(i + 1, len(mul_pos)):
        if add_cnt[mul_pos[i]] - add_cnt[mul_pos[j]]:
            expr.insert(mul_pos[i] + 1, '(')
            expr.insert(mul_pos[j] + 1, ')')
            # print(''.join(expr))
            ans = max(ans, eval(''.join(expr)))
            expr.pop(mul_pos[j] + 1)
            expr.pop(mul_pos[i] + 1)
print(eval(''.join(expr)) if ans == 0 else ans)