#include <cstdio>
#include<bits/stdc++.h>
#include "library.h"
using namespace std;
void Solve(int N)
{
vector<int> M(N,0);
vector<int> arr[N];
int i,j;
for(i = 0; i < N-1; i++) {
if(arr[i].size()==2)continue;
M[i]=1;
for(j=i+1;j<N;j++){
if(arr[j].size()==2)continue;
M[j]=1;
int cum=Query(M);
if(cum==1){
arr[i].push_back(j);
arr[j].push_back(i);
}
M[j]=0;
}
M[i]=0;
}
for(i=0;i<N;i++){
if(arr[i].size()==1)break;
}
vector<bool> vi(N,false);
queue<int> bfs;
bfs.push(i);
vi[i]=true;
i=0;
vector<int> res(N);
while(!bfs.empty()){
int xx=bfs.front();
bfs.pop();
res[i]=xx+1;
i++;
for(int aa:arr[xx]){
if(vi[aa])continue;
vi[aa]=true;
bfs.push(aa);
}
}
Answer(res);
}
