#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e3 + 10, M = 4e5;
string s;
stack<int> st;
stack<char> stc;
ll ans = -999999999;
void solve()
{
	cin >> s;
	int cnt = 0;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == '?')
			cnt++;
	}
	if (cnt == 0)
	{
		for (int i = 0; i < s.size(); i++)
		{
			if (s[i] >= '0' && s[i] <= '9')
			{
				st.push(s[i] - '0');
			}
			else
			{
				if (s[i] == '(' || s[i] == '+' || s[i] == '-')
				{
					stc.push(s[i]);
				}
				else
				{
					while (1)
					{
						int a1 = st.top();
						st.pop();
						char c = stc.top();
						stc.pop();
						int re;
						if (c == '(')
						{
							st.push(a1);
							break;
						}
						int a2 = st.top();
						st.pop();
						if (c == '+')
						{
							re = a1 + a2;
						}
						else if (c == '-')
						{
							re = a2 - a1;
						}
						st.push(re);
					}
				}
			}
		}
		while (st.size() > 1)
		{
			int a1 = st.top();
			st.pop();
			int a2 = st.top();
			st.pop();
			char c = stc.top();
			stc.pop();
			int re = 0;
			if (c == '+')
			{
				re = a1 + a2;
			}
			else
			{
				re = a2 - a1;
			}
			st.push(re);
		}
		cout << st.top();
	}
	else if (cnt == 1)
	{
		for (int w1 = 0; w1 <= 9; w1++)
		{
			while (st.size())
				st.pop();
			while (stc.size())
				stc.pop();
			for (int i = 0; i < s.size(); i++)
			{
				if (s[i] >= '0' && s[i] <= '9')
				{
					st.push(s[i] - '0');
				}
				else if (s[i] == '?')
				{
					st.push(w1);
				}
				else
				{
					if (s[i] == '(' || s[i] == '+' || s[i] == '-')
					{
						stc.push(s[i]);
					}
					else
					{
						while (1)
						{
							int a1 = st.top();
							st.pop();
							char c = stc.top();
							stc.pop();
							int re;
							if (c == '(')
							{
								st.push(a1);
								break;
							}
							int a2 = st.top();
							st.pop();
							if (c == '+')
							{
								re = a1 + a2;
							}
							else if (c == '-')
							{
								re = a2 - a1;
							}
							st.push(re);
						}
					}
				}
			}
			while (st.size() > 1)
			{
				int a1 = st.top();
				st.pop();
				int a2 = st.top();
				st.pop();
				char c = stc.top();
				stc.pop();
				int re = 0;
				if (c == '+')
				{
					re = a1 + a2;
				}
				else
				{
					re = a2 - a1;
				}
				st.push(re);
			}
			ans = max(ans, (ll)st.top());
		}
		cout << ans;
	}
	else if (cnt == 2)
	{
		int f = 0;
		for (int w1 = 0; w1 <= 9; w1++)
		{
			for (int w2 = 0; w2 <= 9; w2++)
			{
				f = 0;
				while (st.size())
					st.pop();
				while (stc.size())
					stc.pop();
				for (int i = 0; i < s.size(); i++)
				{

					if (s[i] >= '0' && s[i] <= '9')
					{
						st.push(s[i] - '0');
					}
					else if (s[i] == '?')
					{
						if (f == 0)
						{
							st.push(w1);
							f = 1;
						}
						else
							st.push(w2);
					}
					else
					{
						if (s[i] == '(' || s[i] == '+' || s[i] == '-')
						{
							stc.push(s[i]);
						}
						else
						{
							while (1)
							{
								int a1 = st.top();
								st.pop();
								char c = stc.top();
								stc.pop();
								int re;
								if (c == '(')
								{
									st.push(a1);
									break;
								}
								int a2 = st.top();
								st.pop();
								if (c == '+')
								{
									re = a1 + a2;
								}
								else if (c == '-')
								{
									re = a2 - a1;
								}
								st.push(re);
							}
						}
					}
				}
				while (st.size() > 1)
				{
					int a1 = st.top();
					st.pop();
					int a2 = st.top();
					st.pop();
					char c = stc.top();
					stc.pop();
					int re = 0;
					if (c == '+')
					{
						re = a1 + a2;
					}
					else
					{
						re = a2 - a1;
					}
					st.push(re);
				}
				ans = max(ans, (ll)st.top());
			}
		}
		cout << ans;
	}
}
int main()
{
	std::ios::sync_with_stdio(0);
	std::cin.tie(0);
	std::cout.tie(0);
	int t = 1;
	// cin >> t;
	while (t--)
		solve();
	return 0;
}