// Code by Parsa Eslami
#include <bits/stdc++.h>
#include "art.h"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define bit(i,j) ((j>>i)&1)
#define minm(x,y) x=min(x,y)
#define maxm(x,y) x=max(x,y)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define S second
#define F first
#define pb push_back
#define SZ(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define err(x) cout<<#x<<": "<<x<<'\n'
#define wtf cout<<"WHAT THE FUCK!\n"
#define dmid int mid=(r+l)/2
#define lc 2*id
#define rc 2*id+1
using namespace std;
void solve(int n){
vector<int> vc;
FOR(i,1,n) vc.pb(i);
int z=publish(vc);
vector<int> ans;
FOR(i,1,n) ans.pb(i);
FOR(i,2,n){
vc[0]=i;
FOR(j,1,i-1) vc[j]=j;
FOR(j,i,n-1) vc[j]=j+1;
int xmy=publish(vc);
xmy-=z;
xmy+=(i-1);
xmy/=2;
FORR(j,i-1,xmy+1) swap(ans[j],ans[j-1]);
}
answer(ans);
}
