#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int f(string s) {
	int sum = 0;
	int t = 0;
	bool fl = true;
	REP(i, s.size()) {
		if (s[i] == '+' || s[i] == '-') {
			if (i == 0 || i == s.size() - 1) {
				return -INF;
			}
			if (fl) {
				sum += t;
			}
			else {
				sum -= t;
			}
			t = 0;
			if (s[i] == '+') {
				fl = true;
			}
			else {
				fl = false;
			}
		}
		else {
			t *= 10;
			t += s[i] - '0';
		}
	}
	if (fl) sum += t;
	else sum -= t;
	return sum;
}

int main() {
	string s;
	cin >> s;
	int ans = -INF;
	REP(i, s.size()) {
		ans = max(ans, f(s));
		s.insert(s.begin(), s.back());
		s.pop_back();
	}
	cout << ans << endl;
	return 0;
}