#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  string s;
  cin >> s;
  const int n = s.size();
  s += s;

  int maxret = -INF;
  REP(i, n) {
    string t = s.substr(i, n);
    if(t[0] == '+' || t[0] == '-' || t[n-1] == '+' || t[n-1] == '-') continue;
    //tについて計算する
    int ret = 0, idx = 0;
    bool a = false, f = false;
    REP(j, n) {
      if(t[j] == '+') {
        int b = stoi(t.substr(idx, j-idx));
        if(f && a) {
          ret += b;
        } else if(f && !a) {
          ret -= b;
        } else if(!f) {
          ret = b;
        }
        f = true; a = true; idx = j+1;
      } else if(t[j] == '-') {
        int b = stoi(t.substr(idx, j-idx));
        if(f && a) {
          ret += b;
        } else if(f && !a) {
          ret -= b;
        } else if(!f) {
          ret = b;
        }
        f = true; a = false; idx = j+1;
      }
    }
    int b = stoi(t.substr(idx, n-idx));
    if(a) {
      ret += b;
    } else {
      ret -= b;
    }
    maxret = max(maxret, ret);
  }

  cout << maxret << endl;
  return 0;
}