#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;

int main() {
	string in;
	cin >> in;
	ll res = 0;
	for(int s=0; s<in.length(); s++) {
		if(in[s]=='+' || in[s]=='-' || in[(s+in.length()-1)%in.length()]=='+' || in[(s+in.length()-1)%in.length()]=='-') {
			continue;
		}
		int i = s;
		ll op = 1;
		ll sum = 0;
		ll num = 0;
		do {
			if(in[i]=='+') {
				sum += op * num;
				op = 1;
				num = 0;
			} else if(in[i]=='-') {
				sum += op * num;
				op = -1;
				num = 0;
			} else {
				num = num*10 + (in[i]-'0');
			}
			i = (i+1) % in.length();
		}while(i!=s);
		sum += op * num;
		res = max(res, sum);
	}
	cout << res << endl;
	return 0;
}