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

using namespace std;

void solve(int n) {
    for (int i = 1; i <= n; ++i) add(i);
    vector<int> p(n), ord;
    iota(p.begin(), p.end(), 1);
    mt19937 rnd;
    shuffle(p.begin(), p.end(), rnd);
    queue<int> Q;
    for (auto x : p) Q.push(x);
    while (!Q.empty()) {
        if (remove(Q.front()) == n - ord.size() - 1) {
            ord.push_back(Q.front()), Q.pop();
        } else {
            add(Q.front()), Q.push(Q.front()), Q.pop();
        }
    }
    reverse(ord.begin(), ord.end());
    vector<int> L(n), R(n);
    for (int i = 1; i < n; ++i) L[i] = 0, R[i] = i - 1;
    while (1) {
        vector< vector<int> > qry(n);
        vector<int> res(n);
        int flg = 0;
        for (int i = 1; i < n; ++i) {
            if (L[i] != R[i]) qry[(L[i] + R[i]) >> 1].push_back(i), flg = 1;
        }
        if (!flg) break;
        for (int i = 0; i < n; ++i) {
            add(ord[i]);
            for (auto t : qry[i]) {
                if (add(ord[t]) == i + 2) res[t] = 1;
                remove(ord[t]);
            }
        }
        for (int i = 1; i <= n; ++i) remove(i);
        for (int i = 1; i < n; ++i) {
            if (L[i] != R[i]) {
                if (!res[i]) L[i] = ((L[i] + R[i]) >> 1) + 1;
                else R[i] = (L[i] + R[i]) >> 1;
            }
        }
    }
    for (int i = 1; i < n; ++i) report(ord[i], ord[L[i]]);
}