#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

struct SyntaxAnalysis {
	string s;
	int i;
	ll val;
	
	SyntaxAnalysis(string s) { init(s); }
	
	void init(string _s) {
		s = _s;
		i = 0;
		val = expr(i);
	}
	
	ll expr(int &i) {
		ll res = term(i);
		while (s[i] == '+' || s[i] == '-') {
			char op = s[i++];
			ll now = term(i);
			
			if (op == '+') res += now;
			else res -= now;
		}
		return res;
	}
	
	ll term(int &i) {
		ll res = factor(i);
		while (s[i] == '*' || s[i] == '/') {
			char op = s[i++];
			ll now = factor(i);
			
			if (op == '*') res *= now;
			else res /= now;
		}
		return res;
	}
	
	ll factor(int &i) {
		if (isdigit(s[i])) return number(i);
		i++;
		ll res = expr(i);
		i++;
		return res;
	}
	
	ll number(int &i) {
		ll res = s[i++] - '0';
		while (isdigit(s[i])) res = res * 10 + s[i++] - '0';
		return res;
	}
	
	ll get() {
		return val;
	}
	
};

int main() {
	string s;
	cin >> s;
	
	ll ans = -INF;
	REP(i, s.size()) {
		rotate(s.begin(), s.begin() + 1, s.end());
		
		if (s[0] == '+' || s[0] == '-' || s[s.size() - 1] == '+' || s[s.size() - 1] == '-') continue;
		
		SyntaxAnalysis sa(s);
		
		chmax(ans, sa.get());
	}
	
	cout << ans << endl;
	
	return 0;
}