#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
    long long ans = 0, ans1 = -100000000007;
    string s;
    long long co = 0;
    cin >> s;
    bool b = true;
    int n = s.size();
    for (int j = 0; j < n; j++) {
        ans = 0;
        co = 0;
        if (s[j] == '+' || s[j] == '-' || s[(j + n - 1) % n] == '+' || s[(j + n - 1) % n] == '-') {
            continue;
        }
        for (int i = 0; i < n; i++) {
            if (s[(i + j) % n] == '+') {
                if (b) {
                    ans += co;
                }
                else {
                    ans -= co;
                }
                b = true;
                co = 0;
            }
            else if (s[(i + j) % n] == '-') {
                if (b) {
                    ans += co;
                }
                else {
                    ans -= co;
                }
                b = false;
                co = 0;
            }
            else {
                co *= 10;
                co += s[(i + j) % n] - '0';
            }
        }
        if (b) {
            ans += co;
        }
        else {
            ans -= co;
        }
        if (ans > ans1) {
            ans1 = ans;
        }
    }
    cout << ans1 << endl;
}