#include "library.h"
#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;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false
const int MAXN = 1000 + 17;
vector<int> graf[MAXN];
vector<int> wyn;
bool w (int i, int x) {
for (auto y : graf[i]) {
if (x == y) {
return 1;
}
}
return 0;
}
void DFS (int v, int o) {
wyn.pb(v + 1);
for (auto x : graf[v]) {
if (x != o) {
DFS(x, v);
}
}
}
void Solve(int n) {
vector<int> m;
for (int i = 0; i < n; i ++) {
m.pb(0);
}
for (int i = 0; i < n; i ++) {
vector<int> poz = {};
for (int j = i + 1; j < n; j ++) {
if (i != j && !w(i, j)) {
poz.pb(j);
}
}
if (int(graf[i].size()) < 2) {
int p = 0, k = int(poz.size()) - 1, w = -1;
while (p <= k) {
int sr = (p + k)/ 2;
for (int j = 0; j < n; j ++) {
m[j] = 0;
}
for (int j = 0; j <= sr; j ++) {
m[poz[j]] = 1;
}
int w1 = Query(m);
m[i] = 1;
int w2 = Query(m);
if (w2 <= w1) {
w = sr;
k = sr - 1;
} else {
p = sr + 1;
}
}
if (w != -1) {
graf[i].pb(poz[w]);
graf[poz[w]].pb(i);
} else {
continue;
}
}
poz = {};
for (int j = i + 1; j < n; j ++) {
if (i != j && !w(i, j)) {
poz.pb(j);
}
}
reverse(poz.begin(), poz.end());
if (int(graf[i].size()) < 2) {
int p = 0, k = int(poz.size()) - 1, w = -1;
while (p <= k) {
int sr = (p + k)/ 2;
for (int j = 0; j < n; j ++) {
m[j] = 0;
}
for (int j = 0; j <= sr; j ++) {
m[poz[j]] = 1;
}
int w1 = Query(m);
m[i] = 1;
int w2 = Query(m);
if (w2 <= w1) {
w = sr;
k = sr - 1;
} else {
p = sr + 1;
}
}
if (w != -1) {
graf[i].pb(poz[w]);
graf[poz[w]].pb(i);
} else {
continue;
}
}
}
/*for (int i = 0; i < n; i ++) {
for (auto x : graf[i]) {
cout << x << " ";
}
cout << "\n";
}*/
int s = 0;
for (int i = 0; i < n; i ++) {
if (int(graf[i].size()) == 1) {
s = i;
break;
}
}
DFS(s, s);
/*for (auto x : wyn) {
cout << x << " ";
}*/
Answer(wyn);
}
