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).
//package round308;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "1+2+3";
	
	void solve() throws Exception
	{
		String x = ns();
		char[] s = x.toCharArray();
		int n = s.length;
		
		Parser3 p3 = new Parser3();
		long base = p3.eval(s);
		
		int[] a = new int[n/2+1];
		for(int i = 0;i < n/2+1;i++){
			a[i] = s[i*2]-'0';
		}
		int[] cum = new int[n/2+2];
		for(int i = 0;i < n/2+1;i++){
			cum[i+1] = cum[i] + a[i];
		}
		
		int[] ast = new int[15];
		int p = 0;
		for(int i = 0;i < n;i++){
			if(s[i] == '*'){
				ast[p++] = i;
			}
		}
		for(int i = -1;i <= p;i++){
			for(int j = i+1;j <= p;j++){
				int L = i == -1 ? -1 : i == p ? n : ast[i];
				int R = j == -1 ? -1 : j == p ? n : ast[j];
				L++;
				String y = x.substring(0, L) + "(" + x.substring(L, R) + ")" + x.substring(R);
				base = Math.max(base, p3.eval(y.toCharArray()));
			}
		}
		out.println(base);
	}
	
	public class Parser3 {
		// exp = exp2 ([+-] exp2)*
		// exp2 = exp3 ([*] exp3)*
		// exp3 = exp4 | '(' exp ')'
		// exp4 = -*digit+{[\.]digit+}
		// digit = [0-9]
		char[] str;
		int pos;
		int n;
		
		public long eval(char[] str) throws Exception
		{
			this.str = str;
			pos = 0;
			n = this.str.length;
			long ret = exp();
			if(pos < n)throw new AssertionError(-1);
			return ret;
		}
		
		public long exp() throws Exception
		{
			long v = exp2();
			while(pos < n && (str[pos] == '+' || str[pos] == '-')){
				char op = str[pos];
				pos++;
				if(pos >= n)throw new AssertionError(pos);
				long w = exp2();
				if(op == '+'){
					v += w;
				}else{
					v -= w;
				}
			}
			return v;
		}
		
		public long exp2() throws Exception
		{
			long v = exp3();
			while(pos < n && (str[pos] == '*')){
//				char op = str[pos];
				pos++;
				if(pos >= n)throw new AssertionError(pos);
				long w = exp3();
				v *= w;
			}
			return v;
		}
		
		public long exp3() throws Exception
		{
			if(pos < n && str[pos] == '('){
				pos++;
				long v = exp();
				if(!(pos < n && str[pos] == ')'))throw new AssertionError(pos);
				pos++;
				return v;
			}else{
				return exp4();
			}
		}
		
		public long exp4() throws Exception
		{
			boolean minus = false;
			while(pos < n && str[pos] == '-'){
				minus = !minus;
				pos++;
			}
			boolean present = false;
			long v = 0;
			while(pos < n && str[pos] >= '0' && str[pos] <= '9'){
				v = v * 10 + digit();
				present = true;
			}
			if(!present)throw new AssertionError(pos);
			if(minus)v = -v;
			return v;
		}
		
		public long digit() throws Exception
		{
			if(pos == n)throw new AssertionError(pos);
			return str[pos++] - '0';
		}
	}
	
	void run() throws Exception
	{
//		int n = 2500, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		char[] u = new char[n*2+1];
//		Arrays.fill(u, '+');
//		for (int i = 0; i < n*2+1; i+=2) {
//			u[i] = (char)('0'+gen.nextInt(10));
//		}
//		for(int i = 0;i < 15;i++){
//			int w = gen.nextInt(n);
//			u[w*2+1] = '*';
//		}
//		sb.append(new String(u));
//		INPUT = sb.toString();
		
		is = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private boolean oj = System.getProperty("ONLINE_JUDGE") != null;
	private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }
}
