#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e9;
const ll INF=1e16;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
string s;
int a;
int func();//+-
int num();
int func2();//*/
int func3();//()
int num(){
    int out=0;
    while(isdigit(s[a])){
        out*=10;out+=s[a]-'0';
        a++;
    }
    return out;
}
int func3(){
    int out;
    if(s[a]=='('){
        a++;
        out=func();
        a++;
    }else out=num();
    return out;
}
int func2(){
    int out=func3();
    while(1){
        if(s[a]=='*'){
            a++;
            out*=func3();
        }else if(s[a]=='/'){
            a++;
            out/=func3();
        }else break;
    }
    return out;
}   
int func(){
    int out=func2();
    while(1){
        if(s[a]=='+'){
            a++;out+=func2();
        }else if(s[a]=='-'){
            a++;out-=func2();
        }else break;
    }
    return out;
}
int main(){
	cin>>s;
	int n=s.size();
	int out=-inf;
	rep(i,11){
		if(!isdigit(s[0])||!isdigit(s[n-1]))continue;
		a=0;
		out=max(out,func());
		s=s.substr(1)+s[0];
	}
	cout<<out<<endl;
}