#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    srand(167);
    bool local = false;
    int N = 30, L = 5;
    vector<string> local_S(N);
    if (local) rep(i, 0, N){
        while (true){
            string tmp;
            rep(j, 0, L){
                tmp += (char)(rand() % 10 + '0');
            }
            bool ok = true;
            rep(a, 0, L) rep(b, a + 1, L){
                if (tmp[a] == tmp[b]) ok = false;
            }
            rep(a, 0, i) if (local_S[a] == tmp) ok = false;
            if (ok){
                local_S[i] = tmp;
                break;
            }
        }
    }
    vector<int> local_ac(N);
    auto hb = [&](string a, string b) -> pair<int, int> {
        pair<int, int> res = {0, 0};
        rep(i, 0, L){
            if (a[i] == b[i]) res.first++;
            else rep(j, 0, L) if (a[i] == b[j]) res.second++;
        }
        return res;
    };

    vector<vector<pair<int, int>>> history;
    vector<string> ask_num;
    vector<vector<int>> ch;

    auto ask = [&](string a) -> void {
        cout << a << endl;
        vector<pair<int, int>> res(N);
        ask_num.push_back(a);
        if (local) {
            rep(i, 0, N) {
                res[i] = hb(a, local_S[i]);
                if (res[i].first == 5) local_ac[i] = 1;
                if (local_ac[i]) res[i] = {5, 0};
            }
            So(res);
        }
        else rep(i, 0, N) cin >> res[i].first >> res[i].second;
        history.push_back(res);
        ch.push_back(vector<int>(N, 0));
    };

    vector<string> koho;
    {
        int x = 1;
        rep(i, 0, L) x *= 10;
        rep(i, 0, x){
            string st;
            int tmp = i;
            rep(k, 0, L) st += ('0' + tmp % 10), tmp /= 10;
            bool ok = true;
            rep(a, 0, L) rep(b, a + 1, L) if (st[a] == st[b]) ok = false;
            if (ok) koho.push_back(st);
        }
        int M = koho.size();
        rep(i, 0, M){
            swap(koho[i], koho[i + rand() % (M - i)]);
        }
    }
    int ac_c = 0;
    int ind = 0;
    while (ac_c != N){
        while (true){
            bool ok = true;
            rep(i, 0, history.size()) if (ok){
                auto tmp = hb(koho[ind], ask_num[i]);
                ok = false;
                rep(k, 0, N) if (ch[i][k] == 0 && tmp == history[i][k]){
                    ok = true;
                    break;
                }
            }
            ind++;
            if (ok) break;
        }
        ask(koho[ind - 1]);
        if (history.back()[N - ac_c - 1].first == 5){
            rep(i, 0, history.size()){
                auto tmp = hb(ask_num[i], ask_num.back());
                rep(j, 0, N) if (ch[i][j] == 0 && tmp == history[i][j]){
                    ch[i][j] = 1;
                    break;
                }
            }
            ac_c++;
        }
    }
    cerr << "ac : " << history.size() << endl;
}