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

using namespace std;

void solve(int N){
    vector <int> ans;
    for (int i = 0; i < N; ++ i) ans.push_back(i);

    int last = query(ans);
    for (int i = 1; i < N; ++ i){
        int cur = i;
        int l = 0;
        int r = i - 1;
        while (l <= r){
            int mid = l + r >> 1;
            vector <int> ask = ans;
            ask[0] = ans[i];
            for (int i = 1; i <= mid; ++ i) ask[i] = ans[i - 1];
            ask[i] = ans[0];
            if (query(ask) > last + mid){
                cur = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        swap(ans[i], ans[cur]);
        last = query(ans);
    }

    answer(ans);
}