#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

bool isOp(char ch) {
	return ch == '+' || ch == '-';
}

int calc(const string &s) {
	if (isOp(s[0]) || isOp(s[s.length() - 1])) return -1000000000;
	int v = 0, res = 0;
	int sign = 1;
	REP(i, s.length()) {
		if (isOp(s[i])) {
			res += sign * v;
			sign = (s[i] == '+') ? 1 : -1;
			v = 0;
		}
		else {
			v *= 10;
			v += s[i] - '0';
		}
	}
	res += sign * v;
	return res;
}

int main(int argc, char **argv) {
	string S;
	cin >> S;
	int res = calc(S);
	FOR(i, 1, S.length()) res = max(res, calc(S.substr(i) + S.substr(0, i)));
	cout << res << endl;
	return 0;
}