#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<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cctype>

#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max)) 

using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VII;
typedef pair<int,int> PII;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

string S;

int solve(int i){
	string s, s1, s2;
	int ans = INT_MIN / 4;
	s1 = S.substr(i);
	s2 = S.substr(0, i);
	s = s1 + s2;
	string digit = "";
	if(s[0] == '+' || s[0] == '-' || s[s.size() - 1] == '+' || s[s.size() - 1] == '-'){
		return ans;
	}
	rep(i, s.size()){
		if(s[i] == '+' || s[i] == '-') break;
		digit += s[i];
	}
	stringstream fs;
	fs << digit;
	fs >> ans;
	digit = "";
	rep(i, s.size()){
		if(s[i] == '+' || s[i] == '-'){
			REP(j, i + 1, s.size()){
				if(s[j] == '+' || s[j] == '-') break;
				digit += s[j];
			}
			stringstream ss;
			ss << digit;
			int d;
			ss >> d;
			if(s[i] == '+') ans += d;
			else ans -= d;
			digit = "";
		}
	}
	return ans;
}

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);
	int ans = INT_MIN / 4;
	cin >> S;
	rep(i, S.size()){
		ans = max(ans, solve(i));
	}
	cout << ans << endl;
	return 0;
}