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

using namespace std;

mt19937 rnd(228);

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

    int best = query(p);

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n - 1; ++j) {
            swap(p[j], p[j + 1]);
            int now = query(p);
            if (now < best) {
                best = now;
            } else {
                swap(p[j], p[j + 1]);
            }
        }
    }

    vector<int> ans(n);

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

    answer(ans);
}