#include <bits/stdc++.h>

using namespace std;

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

vector<pair<int, int>> queries[2];

int ask(int u, int v) {
    cout << "? " << u + 1 << ' ' << v + 1 << endl;
    char res;
    cin >> res;
    assert(res == 'R' || res == 'B');
    int x = res == 'R' ? 0 : 1;
    queries[x].push_back({u, v});
    return x;
}

void solve() {
    int n;
    cin >> n;
    vector<int> v[2];
    for (int i = 1; i < n; ++i) {
        int c = ask(0, i);
        v[c].push_back(i);
    }
    int p0 = 0, p1 = 0;
    while ((int) p0 < v[0].size() && (int) p1 < v[1].size()) {
        int a = v[0][p0];
        int b = v[1][p1];
        int c = ask(a, b);
        if (c == 0) {
            p1++;
        } else {
            p0++;
        }
    }
    cout << "!" << endl;
    int idx = p0 == (int) v[0].size() ? 1 : 0;
    assert((int) queries[idx].size() == n - 1);
    for (auto [a, b]: queries[idx]) {
        cout << a + 1 << ' ' << b + 1 << endl;
    }
}

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();
    }
}