#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include <cassert>
#include "art.h"
#define SZ(x) (LL)(x.size())
#define FR(i,a,b) for(LL i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
typedef std::pair<LD,LD> PLD;
using namespace std;
void solve(int n) {
vector<int> r(n,0);
vector<int> v1;
FR(i,1,n+1) v1.push_back(i);
int a=publish(v1);
vector<int> ranks;
FOR(i,n) ranks.push_back(i);
FR(i,1,n){
vector<int> v2;
FR(j,1,n+1){
if (j!=i) v2.push_back(j);
}
v2.push_back(i);
int a2=publish(v2);
int rnk=(a-a2+(n-i))/2;
//int tmp=ranks[rnk];
r[ranks[rnk]]=i;
ranks.erase(ranks.begin()+rnk);
//cout<<i<<": "<<tmp<<"\n";
}
FOR(i,n){
if (r[i]==0){
r[i]=n;
break;
}
}
answer(r);
}
