#include<bits/stdc++.h>
using namespace std;
const int Z = 22222;
char s[Z];int L;
vector<int> o;
int ld, md, pw[9];
pair<int, int> d[Z];
int su[Z];
void proc(char ch,int st, int en){
	if(ch == '+'){
		ch = '*';
		for(int i=st; i<en; i+=2){
			if(ch=='*')
				s[i] = '9';
			else
				s[i] = '1';
			ch = s[i+1];
		}
	}else{
		ch = '*';
		int cnt = 0;
		for(int i=st; i<en; i+=2){
			if(ch == '/')
				cnt ++;
			ch = s[i+1];
		}
		if (cnt > 6) cnt = 6;
		if (cnt > md)md = cnt;
		d[ld++] = make_pair(cnt, st);
	}
}
void my_put(int st, int dig, int cnt) {
	char ch = '*';
	for (int i = st; ch == '*' || ch == '/'; i+=2) {
		if (ch == '*') {
			if (dig == -1)s[i] = '1';else
				s[i] = char(dig + '0');
			dig = -1;
		}
		else {
			if (cnt > 0) {
				cnt--;
				s[i] = '9';
			}else
				s[i] = '1';
		}
		ch = s[i + 1];
	}
}
int main(){
	scanf("%s", s);
	L = strlen(s);
	md = 0;
	for(int i=0; i < L; i++)
		if(s[i] == '+' || s[i] == '-')
			o.push_back(i);
	int st = 0;
	char c = '+';
	for(int pos : o){
		proc(c, st, pos);
		c = s[pos];
		st = pos + 1;
	}
	proc(c, st, L);

	sort(d, d + ld);
	pw[0] = 1;
	for (int i = 1; i <= md; i++)pw[i] = pw[i - 1] * 9;

	for (int i = ld - 1; i >= 0; i--) {
		su[i] = pw[md - d[i].first] + su[i + 1];
	}

	int tar = ((su[0] - 1) / pw[md] + 1) * pw[md];
	for (int i = 0; i < ld; i++) {
		bool sol = false;
		for(int j=0; j <= d[i].first && !sol; j++)
			for (int k = 9; k >= 1 && !sol; k--) {
				int cur = k * pw[md - j];
				if (cur <= tar && (i < ld-1 && tar - cur >= su[i+1] || i == ld - 1 && tar == cur)) {
					sol = true;
					tar -= cur;
					my_put(d[i].second, k, j);
				}
			}
	}

	printf("%s\n", s);
	return 0;
}