#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

bool f(const string &s, ll idx) {
    return ((s[idx] == '+') || (s[idx] == '-'));
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string s;
    cin >> s;
    ll n = len(s);
    ll ans = LONG_LONG_MIN;
    rep(i, n) {
        string ss = s.substr(n - i) + s.substr(0, n - i);
        if (f(ss, 0) || f(ss, n - 1)) continue;
        bool con = true;
        rep(i, n - 1) {
            if (f(ss, i) && f(ss, i + 1)) {
                con = false;
                break;
            }
        }
        if (!con) continue;
        ll cv = 0, tmp = 0;
        char c = '*';
        rep(i, n) {
            if (!f(ss, i)) {
                cv = cv * 10 + (ss[i] - '0');
            }
            else {
                if (c == '*') {
                    tmp = cv;
                    cv = 0;
                    c = ss[i];
                }
                else if (c == '+') {
                    tmp += cv;
                    cv = 0;
                    c = ss[i];
                }
                else {
                    tmp -= cv;
                    cv = 0;
                    c = ss[i];
                }
            }
        }
        if (c == '*') {
            tmp = cv;
            cv = 0;
        }
        else if (c == '+') {
            tmp += cv;
            cv = 0;
        }
        else {
            tmp -= cv;
            cv = 0;
        }
        ans = max(ans, tmp);
    }
    cout << ans << endl;
    return 0;
}