#include <bits/stdc++.h>
#include "library.h"
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=3e3+100,L=21,bs=701,NN=1e6;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,pre[N],dist[N],vis[N];
vector<int>g[N],ans;
int tmp[N][N];
void dfs(int v,int p=-1){
ans.pb(v+1);
for(int u:g[v])if(u!=p)dfs(u,v);
}
int ask(int r,int x){
if(tmp[r][x+1])return tmp[r][x+1];
vector<int>M(n,0);
for0(r+1)M[i]=1;
if(x!=-1)
M[x]=1;
return tmp[r][x+1]=Query(M);
}
void Solve(int N){
n=N;
for0(n)ask(i,-1);
for1(n-1){
int l=-1,r=i;
while(r-l!=1){
int mid=(l+r)>>1;
if(ask(mid,-1)+1==ask(mid,i))l=mid;
else r=mid;
}
int ans1=r;
if(r==i)continue;
g[i].pb(ans1);
g[ans1].pb(i);
l=-1;r=i;
while(r-l!=1){
int mid=(l+r)>>1;
if(ask(mid,-1)==ask(mid,i))l=mid;
else r=mid;
}
if(r==i)continue;
g[r].pb(i);
g[i].pb(r);
}
for0(n)if(g[i].size()==1){
dfs(i);
break;
}
Answer(ans);
}
