#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e4 + 5;

int n, m;
vector<int> pos[maxn];
vector<vector<int> > vec[maxn];
char s[maxn];

inline void solve(int x, int cnt) {
    s[pos[x].back()] = cnt + '0';
    pos[x].pop_back();
}

int main(){
    scanf("%s", s); n = strlen(s);
    int lstpm = 1, lstmd = 1;
    for (int i = 0; i < n; ++i) {
        // printf("i = %d lstpm = %d lstmd = %d\n", i, lstpm, lstmd);
        if (s[i] == '?') {
            if (lstpm == 1) {
                if (lstmd == 1) s[i] = '9';
                else s[i] = '1';
            }
            else {
                if (lstmd == 1) s[i] = '1';
                else pos[m].push_back(i);
            }
        }
        else {
            if (s[i] == '+') lstpm = 1, lstmd = 1;
            else if (s[i] == '-') lstpm = -1, lstmd = 1;
            else if (s[i] == '*') lstmd = 1;
            else if (s[i] == '/') lstmd = -1;
            if (s[i] == '+' || s[i] == '-') ++m;
        }
    }
    ++m;
    for (int i = 0; i < m; ++i) {
        // printf("i = %d %d\n", i, pos[i].size());
        vec[pos[i].size()].push_back(vector<int>({i}));
    }

    for (int i = n; i; --i) {
        while (vec[i].size()) {
            int cnt = min(9, (int)vec[i].size());
            vector<int> cur;
            for (int j = 0; j < cnt; ++j) {
                vector<int> tmp = vec[i].back(); vec[i].pop_back();
                for (auto x: tmp) cur.push_back(x), solve(x, cnt);
            }
            vec[i - 1].push_back(cur);
        }
    }

    puts(s);
    return 0;
}