#include<bits/stdc++.h>
using namespace std;
#define N 200005
char s[N];
int n;
vector<vector<int>> v[N];
vector<int> pos[N];
signed main()
{
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	scanf("%s",s+1);
	n=strlen(s+1);
	int cur=1,mt=1,lst=1,cnt=0;
	for(int i=1;i<=n;i++)
	{
		if(s[i]=='?')
		{
			if(cur==1&&mt==1) s[i]='9';
			else if(cur==1&&mt==-1) s[i]='1';
			else if(cur==-1&&mt==1) s[i]='1';
			else pos[lst].push_back(i),cnt++;
		}
		else if(s[i]=='*') mt=1;
		else if(s[i]=='/') mt=-1;
		else if(s[i]=='+')
		{
			if(cur==-1) v[cnt].push_back({lst});
			cur=1,cnt=0;
			mt=1;
		}
		else if(s[i]=='-')
		{
			if(cur==-1) v[cnt].push_back({lst});
			cur=-1,cnt=0,lst=i;
			mt=1;
		}
	}
	if(cur==-1) v[cnt].push_back({lst});
	for(int i=N-1;i>=1;i--)
	{
		while(v[i].size()>=1)
		{
			int gov=min((int)v[i].size(),9);
			vector<int> nw;
			for(int j=0;j<gov;j++)
			{
				auto cid=v[i].back(); v[i].pop_back();
				for(int k:cid)
				{
					int p=pos[k].back(); pos[k].pop_back();
					s[p]=gov+'0';
					nw.push_back(k);
				}
			}
			v[i-1].push_back(nw);
		}
	}
	printf("%s\n",s+1);
	return 0;
}