#include "bits/stdc++.h" using namespace std; using VS = vector; using LL = long long; using VI = vector; using VVI = vector; using PII = pair; using PLL = pair; using VL = vector; using VVL = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--) #define debug(x) cerr << #x << ": " << x << endl const int INF = 1e9; const LL LINF = 1e16; const LL MOD = 1000000007; const double PI = acos(-1.0); int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- 2018/09/29 Problem: yukicoder 305 / Link: http://yukicoder.me/problems/no/305 ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ LL N; LL ans = 0LL; int main() { cin.tie(0); ios_base::sync_with_stdio(false); auto ask = [](LL x) { cout << setw(10) << setfill('0') << x << endl; LL num; string s; cin >> num >> s; return PII(num, s == "unlocked"); }; LL val = 0; FOR(i, 0, 10) { LL state = -1; int opt = -1; FOR(j, 0, 10) { LL candidate = val + pow(10, i)*j; PII res = ask(candidate); if (res.second) { return 0; } if (res.first > opt) { opt = res.first; state = candidate; } } val = state; //debug(val); } assert(0); return 0; }