// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
#include "art.h"
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 4005;
int n;
vi shift(vi p) {
vi res(n, 0);
REP (i, 1, n) {
res[i - 1] = p[i];
}
res[n - 1] = p[0];
return res;
}
void solve(int N) {
n = N;
vi p(n, 0), id(n, 0);
iota(ALL(p), 1);
id = p;
int b = publish(id);
ll sm = n * (n + 1) / 2;
REP (i, 0, n - 1) {
id = shift(id);
int tmp = publish(id);
int x = n + 1 - tmp + b;
assert(x % 2 == 0);
x /= 2;
p[x - 1] = i + 1;
b = tmp;
sm -= x;
}
p[sm - 1] = n;
answer(p);
}
