#include "bits/stdc++.h" #include #define _CRT_SECURE_NO_WARNINGS #define REP(i, n) for(decltype(n) i = 0; i < (n); i++) #define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) using namespace std; const int dy[] = { 0, 1, 0, -1 }; const int dx[] = { 1, 0, -1, 0 }; using LL = long long int; using LD = long double; const int INF = (1 << 30) - 1; const LL INF64 = ((LL)1 << 62) - 1; const double PI = 3.1415926535897932384626433832795; using pii = pair; using pll = pair; using pdd = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vvd = vector; using vs = vector; using vb = vector; using vvb = vector; int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; } bool check(char c) { if (c == '+' || c == '-') { return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int n = s.size(); int ans = -1145141919; REP(i, n) { int ret = 0; rotate(s.begin(), s.begin() + 1, s.end()); istringstream is(s); if (check(s[0]) || check(s[n - 1])) continue; int valA, valB; char op; while (is >> valA >> op >> valB) { ret += (op == '+' ? valA + valB : valA - valB); } ans = max(ans, ret); } cout << ans << endl; return 0; }