#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int iit = 0;
string inp, ans;

typedef pair<vector<int>, vector<int>> VV;

VV parse_mult() {
    vector<int> mul, div;
    mul.pb(iit);
    ++iit;
    while (iit < SZ(inp) && (inp[iit] == '*' || inp[iit] == '/')) {
        if (inp[iit] == '*')
            mul.pb(iit + 1);
        else
            div.pb(iit + 1);
        iit += 2;
    }
    return {mul, div};
}

vector<VV> dt;

void parse() {
    auto mk_add = [&](VV p) {
        for (int i : p.X)
            ans[i] = '9';
        for (int i : p.Y)
            ans[i] = '1';
    };
    auto p = parse_mult(); 
    mk_add(p);
    while (iit < SZ(inp)) {
        if (inp[iit] == '+')
            ++iit, mk_add(parse_mult());
        else {
            ++iit, dt.pb(parse_mult());     
        }
    }
}

const int C = 1e4 + 5;
vector<vector<int>> v[C + 5];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> inp;
    ans = inp;
    parse();
    for (int i = 0; i < SZ(dt); i++)
        v[SZ(dt[i].Y)].pb({i});
    for (int i = C; i >= 1; i--) {
        while (SZ(v[i]) >= 9) {
            vector<int> tmp;
            auto add = [&](vector<int> p) {
                for (int x: p)
                    tmp.pb(x);
                for (int x : p)
                    ans[dt[x].Y.back()] = '9', dt[x].Y.pop_back();
            };
            for (int j = 0; j < 9; j++) {
                add(v[i].back());
                v[i].pop_back();
            }
            v[i - 1].pb(tmp);
        }
    }
    for (auto p : v[0])
        for (int x : p)
            for (int y : dt[x].X)
                ans[y] = '1';

    auto mk = [&](int i, int a, int b) { // a / (9 ^ b)
        assert(SZ(dt[i].Y) >= b); 
        ans[dt[i].X.back()] = ('0' + a);
        dt[i].X.pop_back();
        for (int x : dt[i].X)
            ans[x] = '1';  
        for (int j = 0; j < b; j++)
            ans[dt[i].Y.back()] = '9', dt[i].Y.pop_back();
        for (int x : dt[i].Y)
            ans[x] = '1';
    };
    vector<int> ord;
    for (int i = 1; i < C; i++)
        if (SZ(v[i]))
            ord.pb(i);
    for (int i = 0; i < SZ(ord); i++) {
        int t = ord[i];
        int need = (i + 1 == SZ(ord) ? 9 : 8);  
        for (int j = 0; j < SZ(v[t]); j++) {
            int a = (j + 1 == SZ(v[t]) ? need : 1);
            need -= a;
            int b = i + 1;
            for (int x : v[t][j])
                mk(x, a, b);
        }
    }
    cout << ans << endl;
}