#include<bits/stdc++.h>

using namespace std;

bool check(string s){
  sort(s.begin(),s.end());
  for(int i=1;i<s.size();i++){
    if(s[i-1]==s[i]){return false;}
  }
  return true;
}

int hbc(string s,string t){
  int res=0;
  for(int k=0;k<5;k++){
    if(s[k]==t[k]){res+=6;}
  }
  for(int k=0;k<5;k++){
    for(int l=0;l<5;l++){
      if(k==l){continue;}
      if(s[k]==t[l]){res++;}
    }
  }
  return res;
}

int main(){
  vector<string> s;
  for(int i=0;i<=99999;i++){
    int v=i;
    string cur;
    for(int j=0;j<5;j++){
      cur.push_back('0'+v%10);
      v/=10;
    }
    reverse(cur.begin(),cur.end());
    if(check(cur)){s.push_back(cur);}
  }

  vector<int> alive;
  for(int i=0;i<s.size();i++){
    alive.push_back(i);
  }
  while(true){
    string q=s[alive.back()];
    alive.pop_back();
    cout << q << "\n";
    fflush(stdout);

    vector<int> fl(32,0);
    vector<pair<int,int>> hb(30);
    for(auto &nx : hb){
      cin >> nx.first >> nx.second;
      fl[nx.first*6+nx.second]=1;
    }
    if(hb[0].first==5){return 0;}

    vector<int> und;
    for(auto &nx : alive){
      if(fl[hbc(q,s[nx])]){und.push_back(nx);}
    }
    alive=und;
  }
}