#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

void solve() {
	string s;
	cin >> s;	

	int n = s.size();

	array<char, 10> v = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
	array<int , 2> k = {};
	vector<string> str;

	if (count(s.begin(), s.end(), '?')) {
		k[0] = find(s.begin(), s.end(), '?') - s.begin();
		k[1] = n - 1 - (find(s.rbegin(), s.rend(), '?') - s.rbegin());
		for (int i = 0; i < 10; ++ i) {
			for (int j = 0; j < 10; ++ j) {
				s[k[0]] = v[i];
				s[k[1]] = v[j];
				str.push_back(s);
				s[k[0]] = '?';
				s[k[1]] = '?';
			}
		}
	} else {
		str.push_back(s);
	}

	int ans = 0;
	for (const auto &t : str) {
		stack<char> op;
		stack<int> stk;

		auto eval = [&]() {
			while (!op.empty()) {
				char o = op.top();
				op.pop();

				if (o == '(') {
					break;
				}
				int x = stk.top() - '0'; stk.pop();
				int y = stk.top() - '0'; stk.pop();
				if (o == '+') {
					stk.push(x + y);
				} else {
					stk.push(y - x);
				}
			}
		};

		for (char c : t) {
			if (c == ')') {
				eval();
			} else if (isdigit(c)) {
				stk.push(c);
			} else {
				op.push(c);
			}
		}
		eval();
		ans = max(ans, stk.top());
	}
	cout << ans << "\n";
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	solve();

	return 0;
}