#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
#include "chameleon.h"
vi adjList[1001];
int ans[1001];
int query(vi v,int u) {
v.pb(u);
return Query(v) < v.size();
}
void Solve(int N) {
int i,j,k;
vector<vi> vv;
for (i = 1; i <= 2*N; i++) {
for (j = 0; j < vv.size(); j++) {
if (!query(vv[j],i)) {
vv[j].pb(i);
break;
}
}
if (j == vv.size()) vv.pb(vi(1,i));
}
for (i = 1; i <= 2*N; i++) {
for (j = 0; j < vv.size(); j++) {
if (find(vv[j].begin(),vv[j].end(),i) == vv[j].end()) {
vi v;
for (k = 0; k < vv[j].size(); k++) {
if (vv[j][k] < i) v.pb(vv[j][k]);
}
while (query(v,i)) {
int l = 0,r = v.size()-1;
while (l < r) {
int m = (l+r+1) / 2;
if (query(vi(v.begin()+m,v.end()),i)) l = m;
else r = m-1;
}
adjList[i].pb(v[l]),adjList[v[l]].pb(i);
v.resize(l);
}
}
}
}
for (i = 1; i <= 2*N; i++) {
if (adjList[i].size() == 3) {
vi v;
v.pb(i),v.pb(adjList[i][0]),v.pb(adjList[i][1]);
if (Query(v) == 1) adjList[i].pop_back();
else {
v[2] = adjList[i][2];
if (Query(v) == 1) swap(adjList[i][1],adjList[i][2]),adjList[i].pop_back();
else swap(adjList[i][0],adjList[i][2]),adjList[i].pop_back();
}
}
}
for (i = 1; i <= 2*N; i++) {
for (j = 0; j < adjList[i].size(); j++) {
int v = adjList[i][j];
if (find(adjList[v].begin(),adjList[v].end(),i) != adjList[v].end()) ans[i] = v;
}
}
for (i = 1; i <= 2*N; i++) {
if (ans[i] > i) Answer(i,ans[i]);
}
}
