#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())
#define MP(a,b) make_pair(a,b)
#define FORE(a,b) for(auto &&a:b)

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

int main(void){
	string s; cin>>s;
	char b;
	int mn=INT_MIN;
	int n[2];
	REP(i,s.size()){
		DEBUG(s);
		int id=0,bn=0; unsigned char p=0; //1:+ 2:-
		int buf=0;
		if((!('0'<=s[0]&&s[0]<='9'))||(!('0'<=s[s.size()-1]&&s[s.size()-1]<='9'))){
			b=s[0]; s.erase(s.begin());
			s.push_back(b);
			continue;
		}
		REP(i,2) n[i]=0;
		REP(j,s.size()){
			if(!('0'<=s[j]&&s[j]<='9')){
				if(!p){
					bn=n[id];
				}else{
					(p==1)?bn+=n[id]:bn-=n[id];
				}
				(s[j]=='+')?p=1:p=2;
				n[id]=0;
				id=(id+1)%2;
			}else{
				n[id]*=10; n[id]+=(s[j]-'0');
			}
		}
		(p==1)?bn+=n[id]:bn-=n[id];
		mn=max(mn,bn);
		b=s[0]; s.erase(s.begin());
		s.push_back(b);
	}
	cout<<mn<<endl;
}