#include <bits/stdc++.h>

std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());

int query(const std::vector<int> &a) {
    std::cout << "0 ";
    for (int i : a) {
        std::cout << i + 1 << ' ';
    }
    std::cout << std::endl;
    int res;
    std::cin >> res;
    return res;
}
void answer(const std::vector<int> &a) {
    std::cout << "1 ";
    for (int i : a) {
        std::cout << i + 1 << ' ';
    }
    std::cout << std::endl;
}

int main() {
    int n;
    std::cin >> n;

    std::vector<int> all(n);
    std::iota(all.begin(), all.end(), 0);

    std::vector<int> p(n);
    auto solve = [&](auto self, int l, int r, std::vector<int> arr) -> void {
        // std::cout << "(" << l + 1 << ", " << r + 1 << ") ";
        // for (int i : arr) {
        //     std::cout << i + 1 << ' ';
        // }
        // std::cout << '\n';
        // assert(arr.size() == r - l + 1);
        
        if (l == r) {
            p[l] = arr[0];
            return;
        }

        std::shuffle(arr.begin(), arr.end(), rng);

        std::vector<std::vector<int>> pack;
        for (int i : arr) {
            pack.push_back(std::vector<int>{i});
        }

        int mid = (l + r) / 2;
        
        std::vector<int> L, R;
        auto cap_L = [&]() {
            return mid - l + 1 - L.size();
        };
        auto cap_R = [&]() {
            return r - mid - R.size();
        };

        while (!pack.empty()) {
            auto a = pack.back();
            pack.pop_back();
            if (a.size() > cap_L()) {
                R.insert(R.end(), a.begin(), a.end());
            } else if (a.size() > cap_R()) {
                L.insert(L.end(), a.begin(), a.end());
            } else {
                assert(!pack.empty());
                auto b = pack.back();
                pack.pop_back();
            
                if (b.size() > cap_L()) {
                    L.insert(L.end(), a.begin(), a.end());
                    R.insert(R.end(), b.begin(), b.end());
                } else if (b.size() > cap_R()) {
                    L.insert(L.end(), b.begin(), b.end());
                    R.insert(R.end(), a.begin(), a.end());
                } else {
                    int x = a.back(), y = b.back();
                    std::vector<int> q(n, x);
                    for (int i = mid + 1; i <= r; ++i) {
                        q[i] = y;
                    }
                    int rsps = query(q);
                    if (rsps == 2) {
                        L.insert(L.end(), a.begin(), a.end());
                        R.insert(R.end(), b.begin(), b.end());
                    } else if (rsps == 0) {
                        L.insert(L.end(), b.begin(), b.end());
                        R.insert(R.end(), a.begin(), a.end());
                    } else {
                        a.insert(a.end(), b.begin(), b.end());
                        pack.push_back(a);
                    }
                }
            }
        }

        self(self, l, mid, L);
        self(self, mid + 1, r, R);
    };
    solve(solve, 0, n - 1, all);

    answer(p);
}