#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


int calc(string s){
	long long res=0,v=0;
	int i;
	char op=0;
	for(i=0;s[i]!='+'&&s[i]!='-'&&i<s.size();i++)res=res*10+s[i]-'0';
	if(i<s.size())op=s[i];
	for(i++;i<s.size();i++){
		if(s[i]=='+'||s[i]=='-'){
			if(op=='+')res+=v;
			else res-=v;
			op=s[i];
			v=0;
		}else{
			v=v*10+s[i]-'0';
		}
	}
	if(op){
		if(op=='+')res+=v;
		else res-=v;
	}
	return res;
}

int main(){
	string s;
	cin>>s;
	int ans=-INF;
	rep(i,s.size()){
		if(s[i]=='+'||s[i]=='-')continue;
		if(s[(i-1+s.size())%s.size()]=='+'||s[(i-1+s.size())%s.size()]=='-')continue;
		ans=max(ans,calc(s.substr(i)+s.substr(0,i)));
	}
	cout<<ans<<endl;
	return 0;
}