#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

map<char, int> pr {
	{'(', 0}, {')', 0}, {'+', 1}, {'-', 1},
	{'*', 2}, {'/', 2}
};

i64 eval(const string &s) {
	int n = s.size();
	stack<char> op;
	stack<int> num;

	auto calc = [&]() {
		i64 rhs = num.top(); num.pop();
		i64 lhs = num.top(); num.pop();
		char o = op.top(); op.pop();

		i64 res = 0;
		if (o == '+') {
			res = lhs + rhs;
		}
		if (o == '-') {
			res = lhs - rhs;
		}
		if (o == '*') {
			res = lhs - rhs;
		}
		if (o == '/') {
			res = lhs / rhs;
		}
		num.push(res);
	};

	for (int i = 0; i < n; ++ i) {
		char c = s[i];
		if (isdigit(c)) {
			i64 x = 0;
			int j = i;
			while (j < n && isdigit(s[j])) {
				x = x * 10LL + (s[j] - '0');
				++ j;
			}
			i = j - 1;
			num.push(x);
		} else if (c == '(') {
			op.push(c);
		} else if (c == ')') {
			while (!op.empty() && op.top() != '(') {
				calc();
			}
			op.pop();
		} else {
			while (!op.empty() && pr[op.top()] >= pr[c]) {
				calc();
			}
			op.push(c);
		}
	}
	while (!op.empty()) {
		calc();
	} 
	return num.top();
}

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

	int n = s.size();

	vector<int> q;
	for (int i = 0; i < n; ++ i) {
		if (s[i] == '?') {
			q.push_back(i);
		}
	}

	int ans = -0x3f3f3f3f;
	for (char x : {'0', '9'}) {
		for (char y : {'0', '9'}) {
			if (q.size() > 0) {
				s[q[0]] = x;
			}
			if (q.size() > 1) {
				s[q[1]] = y;
			}
			ans = max<i64>(ans, eval(s));
		}
	}
	cout << ans << "\n";
}

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

	solve();

	return 0;
}