#include "library3.h"

#include <bits/stdc++.h>
#include <random>
using namespace std;

mt19937 rng(time(0));

struct DSU {
    vector<int> p;

    DSU() = default;
    DSU(int n) : p(n) {
        iota(p.begin(), p.end(), 0);
    }

    int get(int u) {
        return p[u] == u ? u : p[u] = get(p[u]);
    }

    void unite(int u, int v) {
        u = get(u), v = get(v);
        p[v] = u;
    }
};

void solve(int n) {
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    int lst = query(p);
    for (int i = 1; i < n; ++i) {
        swap(p[0], p[i]);
        int cur = query(p);
        if (cur > lst) {
            lst = cur;
        } else {
            swap(p[0], p[i]);
        }
    }
    assert(lst == n - 1);
    auto solve = [&](auto solve, vector<int> v) -> void {
        if (v.size() == 1) return;
        int id = rng() % (v.size() - 1) + 1;
        swap(p[v[0]], p[v[id]]);
        int lst = query(p);
        vector<int> lft, rgt;
        for (int i = 0; i < v.size(); ++i) {
            if (i == 0) lft.push_back(v[i]);
            else if (i == id) rgt.push_back(v[i]);
            else {
                swap(p[v[0]], p[v[i]]);
                int cur = query(p);
                swap(p[v[0]], p[v[i]]);
                if (cur < lst) lft.push_back(v[i]);
                else rgt.push_back(v[i]);
            }
        }
        solve(solve, lft);
        solve(solve, rgt);
    };
    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    solve(solve, v);
    answer(p);
}