#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
typedef unsigned long long u64;
typedef double lf;

const int maxw = 50;
const int maxn = 1000;

const int inf = 1e9;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
#ifndef ONLINE_JUDGE
bitset<maxw> a[maxn];
bool found;

void gen() {
    for (int i = 0; i + 1 < n; i++) {
        a[i].reset();
        for (int j = 0; j < maxw; j++) {
            a[i].set(j, rng() % 2);
        }
    }
    a[n - 1] = a[0];
    shuffle(a, a + n, rng);
    found = false;
}

#endif

int ask(int i, int j) {
    if (i == j) return 0;
    #ifndef ONLINE_JUDGE
        cerr << "? " << i + 1 << " " << j + 1 << endl;
        int x = (int) ((a[i] ^ a[j]).count());
        cerr << x << endl;
        if (x == 0) {
            found = true;
            exit(0);
        }
        return x;
    #else
        cout << i + 1 << " " << j + 1 << endl;
        int x;
        cin >> x;
        if (x == 0) exit(0);
        return x;
    #endif
}

void solve() {
    cin >> n;
#ifndef ONLINE_JUDGE
    gen();
#endif
    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    shuffle(v.begin(), v.end(), rng);

    const int K = 25;
    vector<pair<int, vector<int>>> dst(n, {0, vector<int>(K)});
    for (int i = 0; i < n; ++i) dst[i].first = i;

    for (int i = 0; i < min(n, 25); i++) {
        int x = v[i];
        for (int j = 0; j < n; ++j) {
            dst[j].second[i] = ask(x, j);
        }
    }
    sort(dst.begin(), dst.end(), [&](const auto &a, const auto &b) {
        return a.second < b.second;
    });
    for (int i = 0; i + 1 < n; ++i) {
        if (dst[i].second == dst[i + 1].second) {
            ask(dst[i].first, dst[i + 1].first);
        }
    }
#ifndef ONLINE_JUDGE
    if (!found) {
        cout << "FAIL" << endl;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < maxw; j++) {
                cout << a[i][j];
            }
            cout << endl;
        }
        cout << endl;
    }
#endif
}

signed main() {
#ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}