#include <bits/stdc++.h>
using namespace std;

void Sorting(int L, int R, int U, int V) {
    vector<int> lt, rt; lt.clear(); rt.clear();
    for (int i = L; i <= R; i++)
        lt.push_back(i);

    for (int i = U; i <= V; i++)
        rt.push_back(i);

    int i = 0, j = 0; vector<int> pos;
    while (i < lt.size() && j < rt.size()) {
        cout << lt[i] << ' ' << rt[j] << endl;
        int res;
//        res = Swap(lt[i], rt[j]);
        cin >> res;
        if (res == -1) exit(0);
        if (res == 0) {
            pos.push_back(lt[i]);
            i++;
        }
        else {
            swap(lt[i], rt[j]);
            pos.push_back(rt[j]);
            j++;
        }
    }

    while (i < lt.size()) {
        pos.push_back(lt[i]);
        i++;
    }

    while (j < rt.size()) {
        pos.push_back(rt[j]);
        j++;
    }

//    cout << "Pos ";
//    for (auto x: pos)
//        cout << x << ' ';
//    cout << '\n';

    for (int i = 1; i <= V - L + 1; i++) {
        int p;
        for (p = 0; p < V - L + 1; p++)
            if (pos[p] == L + i - 1) break;
        if (p + 1 == i) continue;
        cout << pos[p] << ' ' << pos[i - 1] << endl;

        int res; cin >> res;
        if (res == -1) exit(0);
//        res = Swap(pos[p], pos[i - 1]);
        swap(pos[i - 1], pos[p]);
    }
}

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

    int L = 1;
    vector<pair<int, int>> save;
    for (int i = 1; i < n; i++) {
        cout << i << ' ' << i + 1 << endl;
        int res;
//        res = Swap(i, i + 1);
        cin >> res;

        if (res == -1) exit(0);

        if (res == 1) {
            if (L != i) save.push_back({L, i - 1});
            L = i;
        }
    }

    save.push_back({L, n});
//    for (auto [x, y]: save)
//        cout << x << ' ' << y << '\n';

    while (save.size() != 1) {
        int best = n + 1, place = 0;
        for (int i = 1; i < save.size(); i++) {
            if (save[i].second + save[i - 1].second - save[i].first - save[i - 1].first < best) {
                best = save[i].second + save[i - 1].second - save[i].first - save[i - 1].first;
                place = i;
            }
        }

        int L = save[place - 1].first, R = save[place - 1].second, u = save[place].first, v = save[place].second;
        Sorting(L, R, u, v);

        save[place] = {L, v};
        save.erase(save.begin() + place - 1, save.begin() + place);
    }

    cout << -1 << ' ' << -1 << endl;

    return 0;
}