#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };


int isnum(char c) {
	if (0 <= c - '0' && c - '0' <= 9)return 1;
	else return 0;
}


int check(string s) {
	int ret = 0;
	int temp = 0;
	reverse(all(s));
	int pre = 0;
	int p = 1;
	rep(i, 0, s.size()) {
		if (isnum(s[i])) {
			temp += p * (s[i] - '0');
			p *= 10;
			pre = 0;
		}
		else {
			if (i == 0 || i == s.size()-1)return -101010;
			else if (pre == 1)return -101010;
			else {
				if (s[i] == '+')ret += temp;
				else ret -= temp;
				temp = 0;
				pre = 1;
				p = 1;
			}
		}
	}
	ret += temp;
	return ret;
}

int main() {
	string s;
	cin >> s;
	int sz = s.size();

	int ans = -101010;
	rep(i,0,sz) {
		string temp = "";
		rep(j,i,i+sz) {
			temp += s[j % sz];
		}
		ans = max(ans,check(temp));
	}
	cout << ans << endl;

	return 0;
}