#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s; cin >> s;
    int n = s.size();
    s += s;
    ll ans = -1001001001001001;
    rep(i,n){
        string t;
        rep(j,n) t += s[i+j];
        if(t[0]=='+'||t[0]=='-'||t[n-1]=='+'||t[n-1]=='-') continue;
        ll tmp = 0;
        ll now = 0;
        int mode = 0;
        rep(j,n){
            if(t[j] == '+'){
                if(mode == 0){
                    tmp += now;
                    now = 0;
                }else{
                    tmp -= now;
                    now = 0;
                }
                mode = 0;
            }else if(t[j] == '-'){
                if(mode == 0){
                    tmp += now;
                    now = 0;
                }else{
                    tmp -= now;
                    now = 0;
                }
                mode = 1;
            }else{
                now *= 10;
                now += t[j] - '0';
            }
        }
        if(mode == 0) tmp += now;
        else tmp -= now;
        ans = max(ans, tmp);
    }

    cout << ans << endl;
    return 0;
}