#include using namespace std; #define fst(t) std::get<0>(t) #define snd(t) std::get<1>(t) #define thd(t) std::get<2>(t) #define unless(p) if(!(p)) #define until(p) while(!(p)) using ll = long long; using P = std::tuple; using P4 = std::tuple; const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; P ask(int x1, int x2, int x3, int x4){ std::cout << x1 << " " << x2 << " " << x3 << " " << x4 << std::endl; int a, b; std::cin >> a >> b; return std::make_tuple(a, b); } P4 f(int a){ int xs[4]; iota(xs, xs+4, a); int s, t; tie(s, t) = ask(xs[0], xs[1], xs[2], xs[3]); if(s == 4){ exit(4); } int n = s + t; int res[4]; fill(res, res+4, -2); while(true){ int s; tie(s, ignore) = ask(xs[0], xs[1], xs[2], xs[3]); if(s == 4){ exit(0); }else if(s == n){ if(res[0] == -2){ copy(xs, xs+4, res); }else{ for(int i=0;i<4;++i){ res[i] = xs[i] == res[i] ? res[i] : -1; } } } if(!next_permutation(xs, xs+4)){ break; } } return std::make_tuple(res[0], res[1], res[2], res[3]); } int main(){ std::cin.tie(nullptr); std::ios::sync_with_stdio(false); int as[4], bs[4]; tie(as[0], as[1], as[2], as[3]) = f(0); tie(bs[0], bs[1], bs[2], bs[3]) = f(4); for(int i=0;i<4;++i){ as[i] = as[i] != -1 ? as[i] : bs[i]; bs[i] = as[i]; } { int nxt = 8; for(int i=0;i<4;++i){ if(bs[i] == -1){ bs[i] = nxt; ++nxt; } } int s; tie(s, ignore) = ask(bs[0], bs[1], bs[2], bs[3]); if(s == 4){ return 0; } } { copy(as, as+4, bs); int nxt = 9; for(int i=0;i<4;++i){ if(bs[i] == -1){ bs[i] = nxt; --nxt; } } ask(bs[0], bs[1], bs[2], bs[3]); } }