#pragma once
#include "permutation.h"
#include <bits/stdc++.h>

namespace {
    using namespace std;
    mt19937 rnd(228);
}

void solve(int n) {
    vector<int> p(n);
    iota(p.begin(), p.end(), 1);

    auto qry = [&](vector<int> v, int pos, int i) {
        v.insert(v.begin() + pos, i);
        return query(v);
    };

    for (int t = 2; t < n; ++t) {
        vector<int> v = p;
        v.pop_back();
        int b = p.back();
        pair<int, int> best{1e9, 0};
        for (int i = 0; i <= t; ++i) {
            best = min(best, {qry(v, i, b), i});
        }
        v.insert(v.begin() + best.second, b);
        p = v;
    }

    vector<int> ans(n);

    for (int i = 0; i < n; ++i) {
        ans[p[i] - 1] = i + 1;
    }

    for (int x : ans) {
        cerr << x << " ";
    }
    cerr << endl;

    answer(ans);
}