#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

int main() {
	string s;

	cin >> s;
	int n = s.size();
	vector<int> a(n, 0);

	long long max_ans = -1e18;

	for (int i = 0; i < n; i++) {
		if (!isdigit(s[i]) || !isdigit(s[(n + i - 1) % n])) {
			continue;
		}

		long long ans = 0, tmp = 0;
		bool isAdd = true;

		for (int j = 0; j < n; j++) {
			int idx = (i + j) % n;

			switch (s[idx]) {
			case '+':
				ans = isAdd ? ans + tmp : ans - tmp;
				tmp = 0;
				isAdd = true;
				break;
			case '-':
				ans = isAdd ? ans + tmp : ans - tmp;
				tmp = 0;
				isAdd = false;
				break;
			default:
				tmp = tmp * 10 + s[idx] - '0';
				break;
			}
		}
		ans = isAdd ? ans + tmp : ans - tmp;
		max_ans = max(ans, max_ans);
	}

	cout << max_ans << endl;
	return 0;
}