// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
read the edi some time ago, remember few things from it:
full solution is d&c/b.s (some logn)
have to find adj links for all nodes
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "library.h"
void Solve(int n)
{
vector<int> adj[n+5];
rep1(i,n){
for(int j = i+1; j <= n; ++j){
vector<int> ask(n);
ask[i-1] = ask[j-1] = 1;
int res = Query(ask);
if(res == 1){
adj[i].pb(j), adj[j].pb(i);
}
}
}
vector<bool> vis(n+5);
int src = -1;
rep1(i,n){
if(sz(adj[i]) == 1){
src = i;
break;
}
}
vector<int> ans;
int u = src;
while(true){
vis[u] = 1;
ans.pb(u);
bool ok = false;
trav(v,adj[u]){
if(!vis[v]){
u = v;
ok = true;
break;
}
}
if(!ok) break;
}
Answer(ans);
}
