#include <bits/stdc++.h>
#include "library.h"
using namespace std;
vector<bool> vis;
vector<int> ans;
vector<vector<int>> g;
void dfs(int u) {
ans.push_back(u + 1);
vis[u] = true;
for (int v : g[u]) {
if (!vis[v]) {
dfs(v);
}
}
}
void Solve(int n) {
g.assign(n, {});
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
vector<int> s(n);
s[i] = s[j] = 1;
if (Query(s) == 1) {
g[i].push_back(j);
g[j].push_back(i);
}
}
}
int u = -1;
for (int i = 0; i < n; i++) {
if (g[i].size() <= 1) {
u = i;
break;
}
}
vis.assign(n, false);
dfs(u);
Answer(ans);
}