#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int main() {

  string s = "0000000000";

  rep(curr, 10) {
    int max = 0, idx = -1;
    rep(i, 10) {
      s[curr] = '0' + i;
      cout << s << endl;
      int x; string judge; cin >> x >> judge;
      if(max < x) {
        max = x; idx = i;
      }
      if(judge == "unlocked") {
        exit(0);
      }
    }

    s[curr] = '0' + idx;
  }

  return 0;
}