#include <bits/stdc++.h>

using namespace std;

#define ll long long

string s;

int calc(int l,int r){
	for (int i = r,j  = 0;i >= l;i--){
		if (s[i] == '(') j++;
		if (s[i] == ')') j--;
		if (j == 0 && s[i] == '+') return calc(l,i - 1) + calc(i + 1,r);
		if (j == 0 && s[i] == '-') return calc(l,i - 1) - calc(i + 1,r);
	}
	if (s[l] == '(' && s[r] == ')') return calc(l + 1,r - 1);
	int ans = 0;
	for (int i = l;i <= r;i++) ans = ans * 10 + s[i] - '0';
	return ans;
}

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

	//string s;
	cin >> s;
	auto n = s.size();

	vector<int> q;
	
	for (int i = 0;i < n;i++){
		if (s[i] == '?') q.push_back(i);
	}
	//cout << q.size() << endl;
	int res = 0;
	for (int i = 0;i <= 9;i++){
		for (int j = 0;j <= 9;j++){
			if (q.size() == 0){
				res = max(res,calc(0,n - 1));
			}
			else if (q.size() == 1){	
				s[q[0]] = '0' + i;
				res = max(res,calc(0,n - 1));
			}else if (q.size() == 2){
				s[q[0]] = '0' + i;
				s[q[1]] = '0' + j;
				res = max(res,calc(0,n - 1));
				//cout << s[i] << endl;
			}
		}
	}

	cout << res << endl;

	return 0;
}