#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];
vector<vector<int>> sol;
int que(int s, int t) {
int x=min(s, t), y=max(s, t);
if (sol[x][y]!=-1) return sol[x][y];
return sol[x][y]=query(x, y);
}
vector<int> calc(int prec, int cur, int n) {
int pos=2;
vector<bool> used(n+1, false); used[prec]=used[cur]=true;
vector<int> res={prec, cur};
A[1]=prec, A[2]=cur;
while (pos!=n) {
pos++;
int val=que(pos, pos-2);
if (prec<cur) {
if (val==cur-prec) {
val=que(pos, pos-1);
A[pos]=cur-val;
cur=A[pos], prec=A[pos-1];
} else if (que(pos, pos-1)==val) {
A[pos]=cur-val;
cur=A[pos], prec=A[pos-1];
} else {
A[pos]=prec+val;
cur=A[pos], prec=A[pos-1];
}
} else {
if (val==prec-cur) {
val=que(pos, pos-1);
A[pos]=cur+val;
cur=A[pos], prec=A[pos-1];
} else if (que(pos, pos-1)==val) {
A[pos]=cur+val;
cur=A[pos], prec=A[pos-1];
} else {
A[pos]=prec-val;
prec=cur, cur=
cur=A[pos], prec=A[pos-1];
}
}
if (cur<1 || cur>n || used[cur] || (cur==1 && used[n])) return {};
used[cur] = true;
res.pb(cur);
}
return res;
}
void solve(int N) {
sol.resize(N+1, vector<int>(N+1, -1));
vector<vector<int>> vals;
for (int i=1; i<=N; i++) {
int prec=i, diff=que(1, 2);
if (prec+diff<=N) vals.pb(calc(prec, prec+diff, N));
if (!vals.empty() && vals.back().empty()) vals.pop_back();
if (prec-diff>=1 && diff!=N-1) vals.pb(calc(prec, prec-diff, N));
if (!vals.empty() && vals.back().empty()) vals.pop_back();
}
assert(sz(vals)==1);
for (int i=1; i<=N; i++) {
answer(i, vals[0][i-1]);
}
}
