#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MP(a,b) make_pair(a,b)
#define PB(a) push_back(a)
#define F first
#define S second
const int INF = 2000000000;
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
struct P{int x;int y;P(int X=0,int Y=0){x=X;y=Y;}};

int main() {
	string S;
	cin >> S;
	int len = S.size();
	S=S+S;
	int ans = 0;
	for(int i=0; i<len; i++) {
		if(S[i]=='+' || S[i]=='-' || S[i+len-1]=='+' || S[i+len-1]=='-') continue;

		string tmp;
		queue<int> num;
		queue<char> en;
		FOR(j,i,i+len) {
			if(S[j]=='+') {
				int n = atoi(tmp.c_str());
				num.push(n);
				tmp="";
				en.push('+');
			}
			else if(S[j]=='-') {
				int n = atoi(tmp.c_str());
				n*=-1;
				num.push(n);
				tmp="";
				en.push('-');
			}
			tmp += S[j];
		}
		int n = atoi(tmp.c_str());
		num.push(n);

		int t=num.front(); num.pop();;
		while(true) {
			int b = num.front(); num.pop();
			char c = en.front(); en.pop();
			if(c=='+') t += b;
			else if(c=='-') t -= b;

			if(num.empty()) break;
		}
		ans = max(ans, t);
	}
	cout << ans << endl;
	return 0;
}