/*input
*/
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;
#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"
const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;
template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }
template<typename T>
void print(vector<T> vec, string name = "") {
cout << name;
for (auto u : vec)
cout << u << ' ';
cout << '\n';
}
void Solve(int N)
{
vii edges(N);
vpi praejo;
auto kiek = [&](int a, int b) {
vi M(N, 0);
for (int i = 0; i < N; ++i)
if (a <= i and i <= b)
M[i] = 1;
return Query(M);
};
auto getJau = [&](int a, int b) {
int ret = 0;
for (auto u : praejo)
ret += (a <= u.x and u.x <= b and a <= u.y and u.y <= b);
return ret;
};
for (int i = 0; i < N - 1; ++i)
{
int l = 0;
int h = N - 1;
int m;
while (l < h) {
m = (l + h) / 2;
if (kiek(0, m) < m + 1 - getJau(0, m))
h = m;
else
l = m + 1;
}
int right = l;
l = 0;
h = right;
while (l < h) {
m = (l + h + 1) / 2;
if (kiek(m, right) < right - m + 1 - getJau(m, right))
l = m;
else
h = m - 1;
}
int left = l;
// printf("i = %d, left = %d, right = %d\n", i, left + 1, right + 1);
// left-right
edges[left].emplace_back(right);
edges[right].emplace_back(left);
praejo.emplace_back(left, right);
}
int curr = 0;
for (int i = 0; i < N; ++i)
if (edges[i].size() == 1) {
curr = i;
break;
}
vi ats = {curr + 1};
int prev = -1;
for (int i = 0; i < N - 1; ++i)
{
for (auto u : edges[curr])
if (u != prev) {
prev = curr;
curr = u;
ats.emplace_back(curr + 1);
break;
}
}
Answer(ats);
}
