#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

#define INF 1000000000000000LL
ll calc(string T){
  ll ret = 0;
  ll now = -INF;
  bool flg = true;
  rep(i,T.length()){
    if('0' <= T[i] && T[i] <= '9'){
      if(now == -INF) now = T[i] - '0';
      else now = now*10 + (T[i]-'0');
    }else{
      if(now == -INF) return now;
      if(flg) ret += now;
      else ret -= now;
      now = -INF;
      if(T[i] == '+') flg = true;
      else flg = false;
    }
  }
  if(flg) ret += now;
  else ret -= now;
  return ret;
}


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

  ll ret = -INF;
  rep(i,S.length()){
    string T = S.substr(i) + S.substr(0,i);

    if(T[0] != '+' && T[0] != '-' && T[S.length()-1] != '+' && T[S.length()-1] != '-'){
      ret = max(ret, calc(T));
    }
  }
  cout << ret << endl;
  return 0;
}