#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define popcountll __builtin_popcountll #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if (p != -1) { x =(x%p+p)%p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; void query(const int a[4]){ cout<>val>>val2; if(val==4)return; int pos=0; bool flag=false; REP(a,4,10){ num[0]=a; query(num); int x,y; cin>>x>>y; if(x==4)return; if(val!=x)flag=true; if(chmax(val,x))pos=a; } if(flag){ num[0]=pos; }else{ num[1]=4,num[2]=5,num[3]=6; val=0; REP(a,1,4){ num[0]=a; query(num); int x,y; cin>>x>>y; if(x==4)return; if(chmax(val,x))pos=a; } num[0]=pos; } num[2]=(num[0]+1)%10,num[3]=(num[0]+2)%10; flag=false; val=0,pos=0; rep(a,10){ if(a==num[0]||a==num[2]||a==num[3])continue; num[1]=a; query(num); int x,y; cin>>x>>y; if(x==4)return; if(val&&val!=x)flag=true; if(val==0)val=x,pos=a; else if(chmax(val,x))pos=a; } if(flag){ num[1]=pos; }else{ int s=-1,t; int b=num[2],c=num[3]; rep(a,10){ if(a!=num[0]&&a!=num[2]&&a!=num[3]){ if(s==-1)s=a; else t=a; } } num[2]=s,num[3]=t; num[1]=b; query(num); int x,y; cin>>x>>y; if(x==4)return; num[1]=c; query(num); int xx,yy; cin>>xx>>yy; if(xx==4)return; if(x>xx)num[1]=b; } val=0,pos=0; flag=false; rep(a,10)if(a!=num[0]&&a!=num[1]){num[3]=a;break;} rep(a,10){ if(a==num[0]||a==num[1]||a==num[3])continue; num[2]=a; query(num); int x,y; cin>>x>>y; if(x==4)return; if(val&&val!=x)flag=true; if(val==0)val=x,pos=a; else if(chmax(val,x))pos=a; } if(flag)num[2]=pos; else{ num[2]=num[3]; } rep(a,10){ if(a==num[0]||a==num[1]||a==num[2])continue; num[3]=a; query(num); int x,y; cin>>x>>y; if(x==4)return; } } int main() { // ios::sync_with_stdio(false); // cin.tie(nullptr); cout << fixed << setprecision(15); solve(); return 0; }