#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    map<pair<int, int>, int> uo;
    auto query = [&](int a, int b) {
        if (uo.count({a, b})) return uo[{a, b}];
        if (uo.count({b, a})) return uo[{b, a}];
        cout << a << " " << b << endl;
        int x;
        cin >> x;
        if (x == 0) exit(0);
        return uo[{a, b}] = x;
    };
    int m = min(10, n);
    map<vector<int>, vector<int>> mp;
    for (int i = 1; i <= n; ++i) {
        vector<int> v;
        for (int j = 1; j <= m; ++j) {
            if (i == j) continue;
            int u = query(i, j);
            v.push_back(u);
        }
        if (i > m) mp[v].push_back(i);
    }
    for (auto &i : mp) {
        if (i.second.size() == 1) {
            continue;
        }
        for (int j = 0; j < i.second.size(); ++j) {
            for (int k = j + 1; k < i.second.size(); ++k) {
                query(i.second[j], i.second[k]);
            }
        }
    }
}