#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <algorithm>
#include <functional>
#include <limits.h>
#include <bitset>

#include <tuple>
#include <unordered_map>

#define mp       make_pair
#define mt       make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

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

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
string str;
int main(){
	int N;
	cin >> str;
	N = str.length();
	string tmp = str + str;
	int res = -114514;
	for (int i = 0; i < N; i++){
		if (!isdigit(tmp[i]) || !isdigit(tmp[i + N - 1]))continue;
		string t = tmp.substr(i, N);
		int sum = 0;
		int d = 0;
		bool plus = true;
		// cout << "t = " << t << endl;
		for (int j = 0; j < t.length(); j++){
			if (!isdigit(t[j])){
				if (plus){
					sum += d;
				}else{
					sum -= d;
				}
				d = 0;
				if (t[j] == '-'){
					plus = false;
				}else{
					plus = true;
				}
			}else{
				d = 10 * d + (t[j] - '0');
			}
		}
		if (plus){
			sum += d;
		}else{
			sum -= d;
		}
		res = max(res, sum);
	}
	cout << res << endl;
	return 0;
}