#include "art.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
void solve(int N) {
vi arr,arr2,ans(N,0);
FOR(i,1,N+1)arr.pb(i);
FOR(i,0,N){
arr2.pb(publish(arr));
arr.pb(arr[0]);
arr.erase(arr.begin());
}
arr2.pb(arr2[0]);
// for(int a:arr2)cerr << a << " ";
// cerr << endl;
FOR(i,0,N){
int pos = arr2[i] - (arr2[i] + arr2[i+1] - N + 1)/2;
ans[pos] = i+1;
}
// for(int a:ans)cerr << a << " ";
// cerr << endl;
vi vis(N,0);
FOR(i,0,N)vis[ans[i]-1] = 1;
FOR(i,0,N){
if(vis[i])continue;
ans[0] = i+1;
break;
}
// for(int a:ans)cerr << a << " ";
// cerr << endl;
answer(ans);
}
