#include <bits/stdc++.h>
#include "art.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(int n){
    vector<int> v(n);
    iota(v.begin(),v.end(),1);
    ll def = publish(v);
    vector<int> tmp = v;
    vector<int> front(n);
    for(int i=0;i<n;i++){
        int x = v[i];
        v.erase(v.begin()+i);
        v.insert(v.begin(),x);
        int b = i == 0 ? def : publish(v);
        front[i] = def-b;
        v = tmp;
    }
    vector<int> ans;
    for(int i=0;i<n;i++) ans.insert(ans.begin()+(i-front[i])/2,v[i]);
    answer(ans);
}