#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
// 回しながらstackで計算
int main(){
  string s;
  cin >> s;
  int len = s.length();
  ll ans = -10000000000;
  // 先頭
  FOR (i,0,len) {
    ll num = 0;
    ll sum = 0;
    if (s[i] == '+' || s[i] == '-') continue;
    if (s[(i + len - 1) % len] == '+' || s[(i + len - 1) % len] == '-') continue;
    vector<ll> vll;
    vector<char> vc;
    FOR (j,0,len) {
      int idx = (i + j) % len;
      if (s[idx] == '+' || s[idx] == '-') {
        vll.push_back(num);
        vc.push_back(s[idx]);
        num = 0;
      } else {
        num *= 10;
        num += s[idx] - '0';
      }
    }
    vll.push_back(num);
    FOR(j,0,vll.size()-1) {
      sum += vc[j] == '+' ? vll[j+1] : -vll[j+1];
    }
    ans = max(ans, sum + vll[0]);
  }
  cout << ans << endl;
  return 0;
}