#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  string s; cin >> s;
  int n = s.length();
  ll ans = -LINF;
  REP(_, n) {
    if (isdigit(s.front()) && isdigit(s.back())) {
      bool is_valid = true;
      FOR(i, 1, n) is_valid &= isdigit(s[i - 1]) || isdigit(s[i]);
      if (is_valid) {
        int i = 0;
        while (i < n && isdigit(s[i])) ++i;
        ll result = stoll(s.substr(0, i));
        while (i < n) {
          int j = i + 1;
          while (j < n && isdigit(s[j])) ++j;
          result += stoll(s.substr(i + 1, j - (i + 1))) * (s[i] == '+' ? 1 : -1);
          i = j;
        }
        chmax(ans, result);
      }
    }
    rotate(s.begin(), s.begin() + 1, s.end());
  }
  cout << ans << '\n';
  return 0;
}