#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	string S;
	while(cin >> S) {
		int ans = -INF;
		rep(i, S.size()) {
			string e = S.substr(i) + S.substr(0, i);
			if(!isdigit(e.front()) || !isdigit(e.back()))
				continue;
			int sign = 1;
			int num = 0;
			int sum = 0;
			for(const char *p = e.c_str(); ; ++ p) {
				if(*p == '+' || *p == 0) {
					sum += num * sign;
					num = 0;
					sign = 1;
					if(*p == 0) break;
				} else if(*p == '-') {
					sum += num * sign;
					num = 0;
					sign = -1;
				} else {
					num = num * 10 + (*p - '0');
				}
			}
			amax(ans, sum);
		}
		printf("%d\n", ans);
	}
	return 0;
}