#include <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int parse(string s) {
    int b = 0;
    int sign = 1;
    int res = 0;
    REP(i, s.length()) {
        if (s[i] == '+' || s[i] == '-') {
            res += sign * stoi(s.substr(b, i));
            sign = (s[i] == '-' ? -1 : 1);
            b = i+1;
        }
    }
    res += sign * stoi(s.substr(b, s.length()));
    return res;
}

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

    int ma = INT_MIN;
    REP(i, s.length()) {
        stringstream ss;
        FOR(j, i, s.length()) ss << s[j];
        FOR(j, 0, i) ss << s[j];

        string e = ss.str();
        int l = e.length()-1;
        if (e[0] == '+' || e[0] == '-' || e[l] == '+' || e[l] == '-') {
            continue;
        }
        ma = max(ma, parse(e));
    }
    cout << ma << endl;
}