#include<bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 30011;
int cnt[N];
int mxdiv = 0;
vector<int > vec[N];
int rela[N];
int nxt[N];
vector<int> pool[N];
int getr(int x) {
	int p = x;
	while(p != rela[p]) {
		p = rela[p];
	}
	int p1 = p; p = x;
	while(p != rela[p]) {
		int p2 = rela[p];
		rela[p] = p1;
		p = p2;
	}
	return p1;
}
void merge(int x, int y) {
	x = getr(x);
	y = getr(y);
	if(x != y) {
		swap(nxt[x], nxt[y]);
		rela[x] = y;
	}
}
int main() {
	string st;
	cin >> st;
	st.pb('+');
	int n = st.size();
	int sign = 1;
	st[0] = '9';
	int np = 1;
	for(int i = 0; i < n; i++) {
		if(st[i] == '+' || st[i] == '-') {
			if(sign == -1) {
				vec[pool[np].size()].pb(np);
				//printf("%d\n", cur.size());
			}
			if(i == n - 1) break;
			np++;
			sign = st[i] == '+' ? 1 : -1;
			if(st[i] == '+') {
				st[i + 1] = '9';
			}else {
				st[i + 1] = '1';
			}
		}else if(st[i] == '*' || st[i] == '/') {
			if(sign == 1) {
				if(st[i] == '*') {
					st[i + 1] = '9';
				}else {
					st[i + 1] = '1';
				}
			}else {
				if(st[i] == '*') {
					st[i + 1] = '1';
				}else {
					pool[np].push_back(i + 1);
				}
			}
		}
	}
	for(int i = 1; i <= np; i++) {
	
		rela[i] = nxt[i] = i;
	}
	for(int i = N - 1; i >= 1; i--) {
		for(int j = 0; j < (int)vec[i].size(); j += 9) {
			//cout << i << ' ' << j << endl;
			int rmn = min((int)vec[i].size(), j + 9) - j;
			for(int k = j + 1; k < min((int)vec[i].size(), j + 9); k++) {
				merge(vec[i][k], vec[i][k - 1]);
			}
			int x = vec[i][j];
			do {
				st[pool[x].back()] = rmn + '0';
				pool[x].pop_back();
				x = nxt[x];
			} while(x != vec[i][j]); 
			vec[i - 1].pb(vec[i][j]);
		}
	}
	for(int i = 0; i < n; i++) {
		if(st[i] == '?') st[i] = '1';
	}
	st.pop_back();
	cout << st << endl;
}