#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <bitset>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define rall(a)		(a).rbegin(), (a).rend()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 1e9;

int solve(string s){

	vector<int> vec;
	string t;
	vector<bool> f;

	rep(i, s.size()){

		if (s[i] >= '0' && s[i] <= '9'){
			t += s[i];
		} else
		{
			if (i == s.size() - 1)return -INF;
			if (!t.size())return -INF;
			vec.push_back(toInt(t));
			t.clear();
			if (s[i] == '-')f.push_back(false);
			if (s[i] == '+')f.push_back(true);
		}
	}
	if (t.size())vec.push_back(toInt(t));
	else return -INF;

	int ans = 0;
	for (int i = 0; i < vec.size(); i++){
		int r = vec[i];
		if (i)if (!f[i - 1])r *= -1;
		ans += r;
	}
	return ans;
}

int main()
{
	string s;
	cin >> s;

	int ans = -INF;
	For(i,0, s.size()+1){
		string t1, t2;
		t1 = s.substr(0, i);
		t2 = s.substr(i, s.size() - i);

		string T = t2 + t1;
		ans = max(ans,solve(T));
	}
	cout << ans << endl;

	return 0;
}