#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int kq[MAXN];
void solve(int n){
int l=1,r=n,res=-1;
while (l<=r){
int mid=(l+r)/2;
if (query(mid,n)==n-1){
res=mid;
l=mid+1;
}
else r=mid-1;
}
answer(res,1);
kq[res]=1;
int prev=0;
FORD(i,res-1,1){
int x=query(i,res);
if (x!=prev){
answer(i,x+1);
kq[i]=x+1;
prev=x;
}
else{
x=query(i,i+1);
answer(i,kq[i+1]-x);
kq[i]=kq[i+1]-x;
}
}
prev=0;
FOR(i,res+1,n){
int x=query(res,i);
if (x==n-1){
answer(i,n);
kq[i]=n;
res=i;
break;
}
if (x!=prev){
answer(i,x+1);
kq[i]=x+1;
prev=x;
}
else{
x=query(i-1,i);
answer(i,kq[i-1]-x);
kq[i]=kq[i-1]-x;
}
}
prev=0;
FOR(i,res+1,n){
int x=query(res,i);
if (x!=prev){
answer(i,n-x);
kq[i]=n-x;
prev=x;
}
else{
x=query(i-1,i);
answer(i,kq[i-1]+x);
kq[i]=kq[i-1]+x;
}
}
}
