#include <cstdio>
#include <cstring>
#include <vector>
#include "library.h"
#include <algorithm>

#define PB push_back

using namespace std;

const int N = 2e4 + 10;

int n, un[N], l[N], r[N];
vector<int> g[N];

int trazi(int u) { return un[u] == -1 ? u : un[u] = trazi(un[u]); }

void upali(int u, vector<int> &q) { 
	for(int i = 0; i < n; ++i) {
		if(trazi(i) == u) { q[i] = 1; }
	}
}

bool kraj(int x, int u) { 
	vector<int> q(n, 0);
	upali(u, q);
	q[l[u]] = 0;
	q[x] = 1;
	if(Query(q) == 2) { 
		g[x].PB(l[u]);
		g[l[u]].PB(x);
		return 0;
	} 
	g[x].PB(r[u]);
	g[r[u]].PB(x);
	return 1;
}

bool bio[N];

void lanac(int u, int p, vector<int> &a) { 
	a.PB(u + 1);
	for(int v : g[u]) { 
		if(v != p) { lanac(v, u, a); }
	}
}

void Solve(int nn) { 
	n = nn;
	memset(un, -1, sizeof(un));
	for(int i = 0; i <= n; ++i) { l[i] = r[i] = i; }

	for(int i = 1; i < n; ++i) { 
//		printf("%d:\n", i);
//		for(int j = 0; j < i; ++j) { printf("%d ", trazi(j)); } printf("\n");
		vector<int> q(n, 0);
		int c = 0;
		memset(bio, 0, sizeof(bio));
		for(int j = 0; j < i; ++j) { bio[trazi(j)] = 1; }
		for(int j = 0; j < i; ++j) { if(bio[j]) { upali(j, q); ++c; } }
		q[i] = 1;
		int res = Query(q);
//		printf("%d %d\n", res, c);
		if(res != c + 1) {
			int fir = -1, sec = -1, f1, f2;
			int lo = -1, hi = i - 1;
//			printf("%d %d\n", lo, hi);
			for(int mi = (lo + hi) / 2; hi - lo > 1; mi = (lo + hi) / 2) { 
				fill(q.begin(), q.end(), 0);
				memset(bio, 0, sizeof(bio));

				int c2 = 0;
				for(int j = 0; j <= mi; ++j) { bio[trazi(j)] = 1; }
				for(int j = 0; j < i; ++j) { if(bio[j]) { upali(j, q); ++c2; } }
				q[i] = 1;

				int res2 = Query(q);
				if(res2 == c2 + 1) { 
					lo = mi;
				} else {
					hi = mi;
				}
			}

			fir = trazi(hi);
//			printf("fir %d\n", fir);
			f1 = kraj(i, trazi(hi));

			if(res != c) {
				int lo2 = -1, hi2 = i - 1;
				for(int mi = (lo2 + hi2) / 2; hi2 - lo2 > 1; mi = (lo2 + hi2) / 2) { 
					fill(q.begin(), q.end(), 0);
					memset(bio, 0, sizeof(bio));

					int c2 = 0;
					for(int j = 0; j <= mi; ++j) { bio[trazi(j)] = 1; }
					bio[fir] = 0;
					for(int j = 0; j < i; ++j) { if(bio[j]) { upali(j, q); ++c2; } }
					q[i] = 1;

					int res2 = Query(q);

					if(res2 == c2 + 1) { 
						lo2 = mi;
					} else {
						hi2 = mi;
					}
				}

				sec = trazi(hi2);
//				printf("sec %d %d\n", sec, hi2);
				f2 = kraj(i, trazi(hi2));
			}

			if(sec == -1) { 
				un[i] = fir;
				if(f1) { r[fir] = i; }
				else { l[fir] = i; }
			} else {
				un[i] = fir;
				un[sec] = i;
				if(f1) { l[fir] = l[sec]; }
				else { r[fir] = r[sec]; }
			}
		}
	}

	vector<int> ans;
	for(int i = 0; i < n; ++i) {
		if(g[i].size() == 1) { lanac(i, -1, ans); break; }
	}
	Answer(ans);
	return;
}