#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=998244353;
const llint big=2.19e18+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}


int main(void){
	string str;cin>>str;str.pub('#');
	
	int rule[3];
	int i;
	llint ans=-9223372036854775807LL;
	for(int bi=0;bi<27;bi++){
		list<pair<char,llint>>shiki;
		shiki.pub(mp('#',0));
		//演算子or数字 数字そのもの
		vector<pair<int,decltype(shiki.begin())>>zyu;
		rule[0]=bi/9;
		rule[1]=bi%9/3;
		rule[2]=bi%3;
		if(rule[0]!=2&&rule[1]!=2&&rule[2]!=2){continue;}
		if(rule[0]!=1&&rule[1]!=1&&rule[2]!=1&&bi!=26){continue;}
		int kakko=0;
		for(i=0;str[i]!='#';i++){
			//cerr<<str[i]<<endl;
			if(str[i]=='('){kakko++;}
			else if(str[i]==')'){kakko--;}
			else if(str[i]=='+'){
				shiki.pub(mp('+',0));
				zyu.pub(mp(kakko*10000+rule[0]*1000-i,prev(shiki.end())));
			}
			else if(str[i]=='-'){
				shiki.pub(mp('-',0));
				zyu.pub(mp(kakko*10000+rule[1]*1000-i,prev(shiki.end())));
			}
			else if(str[i]=='*'){
				shiki.pub(mp('*',0));
				zyu.pub(mp(kakko*10000+rule[2]*1000-i,prev(shiki.end())));
			}else{
				llint num=0;
				while('0'<=str[i]&&str[i]<='9'){num*=10;num+=str[i]-'0';i++;}
				i--;
				shiki.pub(mp('n',num));
			}
		}
		shiki.pub(mp('#',0));
		sort(zyu.begin(),zyu.end(),
			[](pair<int,decltype(shiki.begin())> x,pair<int,decltype(shiki.begin())>y)->int{
				return (x.fir<y.fir);
			}
		);REV(zyu);
		//cerr<<"de"<<__LINE__<<endl;
		for(auto it:zyu){
			
			auto ptr=it.sec;
			llint x,y,z;
			x=prev(ptr)->sec;
			y=next(ptr)->sec;
			
			//cerr<<x<<" "<<(ptr->fir)<<" "<<y<<endl;
			if(ptr->fir=='+'){z=x+y;}
			if(ptr->fir=='-'){z=x-y;}
			if(ptr->fir=='*'){z=x*y;}
			auto qtr=next(next(ptr));
			shiki.erase(prev(ptr));
			shiki.erase(next(ptr));
			shiki.erase(ptr);
			shiki.insert(qtr,mp('n',z));
		}
		maxeq(ans,next(shiki.begin())->sec);
	}
	cout<<ans<<endl;
	return 0;
}


Measured memory_bytes: 3192