#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
set<int> in;
map<int, int> M;
/*
solve(A, B)
A -> C D
B -> E F
solve(C, E), solve(F, D)
*/
int resp;
int ops[3], calls[3], cnt[3];
void solve(set<int> A, set<int> B) {
assert(A.size() == B.size());
if(A.empty()) return;
// found a pair
if(A.size() == 1) {
M[*A.begin()] = *B.begin();
return;
}
// check which scenario solve is in
// 1. all A are in, all B are in
// 2. all A are in, no B are in
// 3. no A are in, no B are in
int ina = 0;
for(int a : A) {
if(in.count(a)) ina++;
}
assert(ina == A.size() || ina == 0);
int inb = 0;
for(int b : B) {
if(in.count(b)) inb++;
}
assert(inb == B.size() || inb == 0);
int scenario;
if(ina == A.size() && inb == B.size()) scenario = 0;
if(ina == A.size() && inb == 0) scenario = 1;
if(ina == 0 && inb == 0) scenario = 2;
calls[scenario]++;
cnt[scenario] += A.size();
if(A.size() == 2) {
if(scenario == 0 || scenario == 1) {
resp = Query(*A.begin()); int nresp = Query(*B.begin());
ops[scenario] += 2;
if(resp != nresp) {
// first of A and B are equal
solve(set<int>{*A.begin()}, set<int>{*B.begin()});
solve(set<int>{*A.rbegin()}, set<int>{*B.rbegin()});
}
else {
solve(set<int>{*A.begin()}, set<int>{*B.rbegin()});
solve(set<int>{*A.rbegin()}, set<int>{*B.begin()});
}
resp = nresp;
return;
}
else if(scenario == 2) {
resp = Query(*A.begin()); int nresp = Query(*B.begin());
ops[scenario] += 2;
if(resp == nresp) {
// first of A and B are equal
solve(set<int>{*A.begin()}, set<int>{*B.begin()});
solve(set<int>{*A.rbegin()}, set<int>{*B.rbegin()});
}
else {
solve(set<int>{*A.begin()}, set<int>{*B.rbegin()});
solve(set<int>{*A.rbegin()}, set<int>{*B.begin()});
}
resp = nresp;
return;
}
}
//
set<int> C, D, E, F;
// split A into C and D
int split = ina == 0 ? A.size()/2 : (A.size()+1)/2;
auto ita = A.begin();
for(int i = 0; i < split; i++) {
C.insert(*ita);
// ensure all C are in
if(!in.count(*ita)) {
resp = Query(*ita); in.insert(*ita);
ops[scenario]++;
}
ita = next(ita);
}
while(ita != A.end()) {
D.insert(*ita);
// ensure no D are in
if(in.count(*ita)) {
resp = Query(*ita); in.erase(*ita);
ops[scenario]++;
}
ita = next(ita);
}
// ------------------
if(inb == 0) {
// none of B are in
for(int b : B) {
int nresp = Query(b); in.insert(b);
ops[scenario]++;
if(nresp != resp) {
F.insert(b);
resp = nresp;
}
else {
E.insert(b);
}
}
solve(C, E), solve(F, D);
}
else {
// all from B are in
for(int b : B) {
int nresp = Query(b); in.erase(b);
ops[scenario]++;
if(nresp != resp) {
F.insert(b);
resp = nresp;
}
else {
E.insert(b);
}
}
solve(C, E), solve(F, D);
}
// cout << A.size() << " " << B.size() << " " << ops[scenario] << "\n";
}
void Solve(int N) {
// sub2: all 1, 2, ..., N are in the first half and in the second half
set<int> A, B;
int resp = -1, nresp;
for(int i = 1; i <= 2*N; i++) {
nresp = Query(i);
in.insert(i);
if(resp != nresp) {
A.insert(i);
resp = nresp;
}
else {
B.insert(i);
}
}
solve(A, B);
cerr << ops[0] << " " << ops[1] << " " << ops[2] << "\n";
cerr << calls[0] << " " << calls[1] << " " << calls[2] << "\n";
cerr << cnt[0] << " " << cnt[1] << " " << cnt[2] << "\n";
cerr << 1.0*ops[0]/calls[0] << " " << 1.0*ops[1]/calls[1] << " " << 1.0*ops[2]/calls[2] << "\n";
cerr << 1.0*ops[0]/cnt[0] << " " << 1.0*ops[1]/cnt[1] << " " << 1.0*ops[2]/cnt[2] << "\n";
// for(auto p : M) {
// cout << p.first << " " << p.second << "\n";
// }
for(auto p : M) {
Answer(p.first, p.second);
}
}
