#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

pair<ll, string> f(string s) {
    cout << s << endl;
    pair<ll, string> ans;
    cin >> ans.first >> ans.second;
    return ans;
}

int main() {
    // cin.tie(0);
    // ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll cv = 0, ck = 1;
    string s = "0000000000";
    auto fv = f(s);
    ll bv = fv.first;
    if (fv.second == "unlocked") {
        return 0;
    }
    rep(i, 10) {
        while(s[i] != '9') {
            string ss = s;
            ss[i] = (char)(ss[i] + 1);
            auto res = f(ss);
            if (res.second == "unlocked") {
                return 0;
            }
            else if (res.first > bv) {
                s = ss;
                bv = res.first;
                break;
            }
            else if (res.first == bv) {
                s = ss;
                bv = res.first;
            }
            else if (res.first < bv) {
                break;
            }
        }
    }
    return 0;
}