#include"integer.h"
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<random>
#include<algorithm>
#define N 5000
using namespace std;
mt19937 RAND(random_device{}());
int delta[N+1],p[N+1],p2[N+1],length,length2,res,cnt;
bool used[N+1];
bool cmp(int x,int y)
{
	return delta[x]<delta[y];
}
vector<int>findPermutation(int n)
{
	vector<int>v(n);
	int dres,ps;
	for (int i=1;i<=n;++i) p[i]=i-1;
	shuffle(p+1,p+n+1,RAND);
	for (int i=1;i<=n;++i) res=operate(i-1);
	length=n;
	while (1)
	{
		sort(p+1,p+length+1,cmp),ps=n,length2=0;
		for (int i=0;i<n;++i) used[i]=0;
		for (int i=1;i<=length;++i)
		{
			delta[p[i]]+=i,dres=res,used[p[i]]=1;
			if (i==1) dres+=(__builtin_popcount(cnt+1)-__builtin_popcount(cnt)-1);
			res=operate(p[i]);
			if (res<=dres) v[p[i]]=ps-(dres-res+1),ps=v[p[i]];
			else p2[++length2]=p[i];
		}
		if (!length2) break;
		for (int i=0;i<n;++i)
			if ((!used[i]||i==ps)&&v[i]>=ps)
				res=operate(i);
		length=length2,cnt++;
		for (int i=1;i<=length;++i) p[i]=p2[i];
	}
	return v;
}