using System; using System.Collections; using System.Collections.Generic; using System.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; class Magatro { static Scanner sc = new Scanner(' '); static void Main() { int[] q = check(); if (q == null) return; int[] arr = new int[4]; for(int i = 0; i < 4; i++) { arr[i] = i; } while (next_permutation(arr)) { int[] ans = new int[4]; for(int i = 0; i < 4; i++) { ans[i] = q[arr[i]]; } Write(ans); if (sc.Next() == "4") return; sc.Next(); } } static int[] check() { for (int i = 0; i <= 6; i++) { for (int j = i + 1; j <= 7; j++) { for (int k = j + 1; k <= 8; k++) { for (int l = k + 1; l <= 9; l++) { Write(i, j, k, l); int x = sc.NextInt(); int y = sc.NextInt(); if (x == 4) return null; if (x + y == 4) return new int[] { i, j, k, l }; } } } } throw new Exception(); } static public bool next_permutation(int[] perm) { int n = perm.Length; int k = -1; for (int i = 1; i < n; i++) if (perm[i - 1] < perm[i]) k = i - 1; if (k == -1) { for (int i = 0; i < n; i++) perm[i] = i; return false; } int l = k + 1; for (int i = l; i < n; i++) if (perm[k] < perm[i]) l = i; int t = perm[k]; perm[k] = perm[l]; perm[l] = t; Array.Reverse(perm, k + 1, perm.Length - (k + 1)); return true; } static void Write(params int[] arr) { Console.WriteLine(string.Join(" ", arr)); } } public class Scanner { public string[] S; private int Index; private char Separator; public Scanner(char separator=' ') { Index = 0; Separator = separator; } public string Next() { string result; if (S == null || Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } private string[] Line() { return Console.ReadLine().Split(Separator); } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } }