#include<bits/stdc++.h>
#include "integer.h"
using namespace std;
const int N=5e3+10;
vector<int>ans;
int pre[N][N],p[N],a[N],suf[N];
int operate(const int i);
vector<int> findPermutation(int n){
    srand(time(0));
    int T=50;
    for(int i=1;i<=n;i++)operate(i-1),p[i]=i;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i!=j)pre[i][j]=1;
    int lst=n,pos=0;
    for(int i=1;i<=n;i++){
        int x=operate(i-1);
        if(x<=lst){pos=i;}
        lst=x;
    }
    operate(pos-1);
    operate(pos-1);
    while(T-->0){
        random_shuffle(p+1,p+1+n);
        for(int i=1;i<=n;i++){
            int x=operate(p[i]-1),y=operate(p[i]-1);
            if(y>x){
                for(int j=i+1;j<=n;j++)pre[p[i]][p[j]]=0;
            }else{
                for(int j=1;j<i;j++)pre[p[i]][p[j]]=0;
            }
        }
        operate(pos-1);operate(pos-1);
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(pre[i][j])suf[j]=i;
    int cnt=0,X=pos;
    while(X)a[X]=cnt++,X=suf[X];
    for(int i=1;i<=n;i++)ans.push_back(a[i]);
    return ans;
}