#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 5003
#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 ans[MAXN][MAXN];
int kq[MAXN];
int ask(int l, int r){
if (ans[l][r]) return ans[l][r];
return ans[l][r]=query(l,r);
}
void writes(int i, int val){
answer(i,val);
kq[i]=val;
}
void solve(int n){
int l=1,r=n,res=-1;
while (l<=r){
int mid=(l+r)/2;
if (ask(mid,n)==n-1){
l=mid+1;
res=mid;
}
else r=mid-1;
}
writes(res,1);
FOR(i,1,n-1) ask(i,i+1);
if (res>=2) writes(res-1,ask(res-1,res)+1);
if (res<=n-1) writes(res+1,ask(res,res+1)+1);
FORD(i,res-2,1){
int x=ask(i,i+1);
int y=ask(i+1,i+2);
int z=ask(i,i+2);
if (kq[i+1]>kq[i+2]){
if (x+y==z){
writes(i,kq[i+1]+x);
}
else{
writes(i,kq[i+1]-x);
}
}
else{
if (x+y==z){
writes(i,kq[i+1]-x);
}
else writes(i,kq[i+1]+x);
}
}
FOR(i,res+2,n){
int x=ask(i-1,i);
int y=ask(i-2,i-1);
int z=ask(i-2,i);
if (kq[i-1]>kq[i-2]){
if (x+y==z){
writes(i,kq[i-1]+x);
}
else{
writes(i,kq[i-1]-x);
}
}
else{
if (x+y==z){
writes(i,kq[i-1]-x);
}
else writes(i,kq[i-1]+x);
}
}
}
