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).
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#########################################################################
# File Name: E.py
# Author: wmg_1001
# mail: wmg_1007@163.com
# Created Time: Fri 19 Jun 2015 01:20:13 AM CST
#########################################################################

S = raw_input()
S = '1*' + S + '*1'
L = len(S)
p = []
for i in range(L):
    if S[i] == '*':
        p.append(i)

L = len(p)
res = eval(S)
for i in range(L):
    for j in range(i + 1, L):
        tS = S[: p[i] + 1] + '(' + S[p[i] + 1 :]
        tS = tS[: p[j] + 1] + ')' + tS[p[j] + 1 :]
        res = max(res, eval(tS))

print res
