using System; using System.Linq; using System.Collections.Generic; class Program { static void Main() { var n = new int[10]; for (int i = 0; i < 10; i++) { for(int j = 0; j < 10; j++) { for(int k = 0; k < 10; k++) { Console.Write(n[k]); } Console.WriteLine(); var output = rs(); if (output == "10 unlocked") return; int memo0 = 0; if(j==0) memo0 = int.Parse(output.Split()[0]); var memo = int.Parse(output.Split()[0]); if (memo0 > memo) break; if (memo0 < memo) { n[i] = j; break; } } } } #region Scan static int ri() { return int.Parse(Console.ReadLine().Trim()); } static long rl() { return long.Parse(Console.ReadLine().Trim()); } static double rd() { return double.Parse(Console.ReadLine().Trim()); } static string rs() { return Console.ReadLine().Trim(); } static int[] ria() { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } static long[] rla() { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } static double[] rda() { return Console.ReadLine().Trim().Split().Select(double.Parse).ToArray(); } static string[] rsa() { return Console.ReadLine().Trim().Split(); } static void mul(out int a, out int b) { var arr = ria(); a = arr[0]; b = arr[1]; } static void mul(out int a, out int b, out int c) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; } static void mul(out int a, out int b, out int c, out int d) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; } static void mul(out long a, out long b) { var arr = rla(); a = arr[0]; b = arr[1]; } static void mul(out long a, out long b, out long c) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; } static void mul(out long a, out long b, out long c, out long d) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; } #endregion #region Math const int mod = 1000000007; static bool isprime(long n){ if (n < 2) return false; for (long i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } static long gcd(long a, long b) { return a == 0 ? b : gcd(b % a, a); } static long lcm(long a, long b) { return a * b / gcd(a, b); } #endregion }