#include <bits/stdc++.h>

using namespace std;

#define LOG(...) printf(__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((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

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;

#define INF 1e9

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

int number(string &s, int &idx, const int &end) {
    int n = 0;
    while (isdigit(s[idx]) && idx <= end) {
        n *= 10;
        n += s[idx] - '0';
        idx++;
    }

    return n;
}

int expression(string &s, int &idx, const int &end) {
    int ret = number(s, idx, end);
    for (; idx <= end;) {
        if (s[idx] == '+') {
            idx++;
            ret += number(s, idx, end);
        } else if (s[idx] == '-') {
            idx++;
            ret -= number(s, idx, end);
        } else {
            break;
        }
    }

    return ret;
}

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

    int res = -INF;
    REP(i, s.length() / 2) {
        int idx = i;
        int eidx = i + s.length() / 2 - 1;
        if (isdigit(s[i]) && isdigit(s[eidx]))
            res = max(res, expression(s, idx, eidx));
    }

    cout << res << endl;
}