#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args &&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; template > using prique = std::priority_queue, U>; template T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); } #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define pb push_back int ask(vector A) { for(int x: A) cout << x; cout << endl; int x; cin >> x; string S; cin >> S; if(S == "unlocked") { exit(0); } return x; } void run_case() { const int N = 10; vector A(N); for(int i = 0; i < N; i++) { vector B; for(int d = 0; d < 10; d++) { A[i] = d; B.pb(ask(A)); } int idx = max_element(all(B)) - B.begin(); A[i] = idx; } ask(A); } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; //cin >> T; while(T--) run_case(); return 0; }