#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<pair<int, int>, int> pp;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}
int gcd(int a, int b){
	if (b > a)swap(a, b);if (b == 0)return a;else{return gcd(b, a%b);}
}

int calc(string s){
	int sum = 0;
	int stuck = 0;
	bool plus = false, minus = false;
	if (s[s.length() - 1] == '+' || s[s.length() - 1] == '-' || s[0] == '+' || s[0] == '-'){
		return -100000000;
	}
	for (int i = 0; i < s.length(); i++){
		if (plus && minus){
			return -100000000;
		}
		if (s[i] == '+'){
			if (plus)return -100000000;
			plus = true;
		}
		else if (s[i] == '-'){
			if (minus)return -100000000;
			minus = true;
		}
		else{
			while (true){
				stuck += s[i] - '0';
				if (s[i + 1] >= '0' && s[i + 1] <= '9'){
					stuck *= 10;
					i++;
				}
				else if (!(s[i + 1] >= '0' && s[i + 1] <= '9') || i == s.length() - 1){
					if (plus){
						sum += stuck;
						plus = false;
					}
					else if (minus){
						sum -= stuck;
						minus = false;
					}
					else if(!plus && !minus){
						sum = stuck;
					}
					stuck = 0;
					break;
				}
			}
		}
	}
	if (plus || minus) return -100000000;
	return sum;
}

void solve() {
	string s;
	int maxi = -10000000;
	cin >> s;
	string ans;
	vector<int> num;
	rep(i, s.length()){
		num.push_back(i);
	}
	for (int i = 0; i < s.length();i++){
		string t = "";
		REP(j,i,s.length()){
			t = t + s[num[j]];
		}
		rep(j, i){
			t = t + s[num[j]];
		}
		if (maxi < calc(t)){
			maxi = max(maxi, calc(t));
			ans = t;
		}
	}
	P(maxi);
}

int main() {
	solve();
	return 0;
}