#include "xylophone.h"
/*
* Author: Nonoze
* Created: Wednesday 17/12/2025
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define double long double
const int inf = numeric_limits<int>::max() / 4;
const int MOD = 1e9+7, LOG=20;
static int A[5001];
int que(int s, int t) {
return query(min(s, t), max(s, t));
}
void calc(int prec, int cur, int val1, int val2) {
int inc=1;
if (val1>val2) inc=-1;
val1+=inc;
int pos=val1;
while (pos!=val2) {
pos+=inc;
int val=que(pos, pos-2*inc);
if (prec<cur) {
if (val==cur-prec) {
val=que(pos, pos-inc);
A[pos]=cur-val;
cur=A[pos], prec=A[pos-inc];
} else if (que(pos, pos-inc)==val) {
A[pos]=cur-val;
cur=A[pos], prec=A[pos-inc];
} else {
A[pos]=prec+val;
cur=A[pos], prec=A[pos-inc];
}
} else {
if (val==prec-cur) {
val=que(pos, pos-inc);
A[pos]=cur+val;
cur=A[pos], prec=A[pos-inc];
} else if (que(pos, pos-inc)==val) {
A[pos]=cur+val;
cur=A[pos], prec=A[pos-inc];
} else {
A[pos]=prec-val;
cur=A[pos], prec=A[pos-inc];
}
}
}
}
void solve(int N) {
int l=2, r=N, emplN=N;
while (l<=r) {
int m=(l+r)/2;
int val=query(1, m);
if (val==N-1) emplN=m, r=m-1;
else l=m+1;
}
l=1, r=emplN-1;
int empl1=1;
while (l<=r) {
int m=(l+r)/2;
int val=query(m, emplN);
if (val==N-1) empl1=m, l=m+1;
else r=m-1;
}
A[emplN]=N, A[empl1]=1;
if (empl1>1) {
int prec=1, cur=query(empl1-1, empl1); A[empl1-1]=cur+1;
calc(prec, cur+1, empl1, 1);
}
if (empl1<emplN-1) {
int prec=1, cur=query(empl1, empl1+1); A[empl1+1]=cur+1;
calc(prec, cur+1, empl1, emplN);
}
if (emplN<N) {
int prec=N, cur=query(emplN, emplN+1); A[emplN+1]=N-cur;
calc(prec, N-cur, emplN, N);
}
for (int i=1; i<=N; i++) {
answer(i, A[i]);
}
}
