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

int f[2][50005];
int find(int col, int x) {
    return f[col][x] == x ? x : f[col][x] = find(col, f[col][x]);
}
map<array<int, 2>, int> qry;
vector<int> adj[50005];
int qry_cnt, N;
int query(int u, int v) {
    if (u > v) swap(u, v);
    if (qry.count({u, v})) return qry[{u, v}];
    adj[u].push_back(v);
    adj[v].push_back(u);
    qry_cnt++;
    assert(qry_cnt <= 2 * N);
    cout << "? " << u << " " << v << endl;
    char col;
    cin >> col;
    int k = 0;
    if (col == 'B') {
        k = 1;
    }
    return qry[{u, v}] = k;
}
bool vis[50005];
void dfs(int u, int p, int col) {
    if (vis[u]) return;
    vis[u] = true;
    for (auto &to : adj[u]) {
        if (to == p) continue;
        if (query(u, to) != col) continue;
        cout << u << " " << to << "\n";
        dfs(to, u, col);
    }
}
vector<int> mp[50005];
signed main() {
    int n;
    cin >> n;
    N = n;
    for (int i = 1 ; i <= n ; i++) {
        f[0][i] = f[1][i] = i;
    }
    unordered_set<int> st0;
    for (int i = 2 ; i <= n ; i++) {
        st0.insert(i);
    }
    queue<int> que;
    que.push(1);
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        vector<int> s;
        for (auto &y : st0) {
            int tx = find(1, x), ty = find(1, y);
            if (tx == ty) continue;
            int k = query(x, y);
            if (k == 0) {
                int ttx = find(0, x), tty = find(0, y);
                f[0][ttx] = tty;
                s.push_back(y);
            } else {
                f[1][tx] = ty;
            }
        }
        for (auto &y : s) {
            st0.erase(y);
            que.push(y);
        }
    }
    if (st0.empty()) {
        // 红色出答案
        cout << "!" << endl;
        dfs(1, 0, 0);
    } else {
        int now = -1;
        for (int i = 1 ; i <= n ; i++) {
            int x = find(1, i);
            mp[x].push_back(i);
            now = x;
        }
        for (int i = 1 ; i <= n ; i++) {
            st0.insert(i);
        }
        for (auto &x : mp[now]) {
            que.push(x);
            st0.erase(x);
        }
        while (!que.empty()) {
            int x = que.front();
            que.pop();
            unordered_set<int> s;
            for (auto &y : st0) {
                int tx = find(0, x), ty = find(0, y);
                if (tx == ty) continue;
                if (s.count(y)) continue;
                int k = query(x, y);
                if (k == 0) {
                    f[0][tx] = ty;
                } else {
                    int ttx = find(1, x), tty = find(1, y);
                    for (auto &z : mp[tty]) {
                        s.insert(z);
                    }
                    f[1][ttx] = tty;
                }
            }
            for (auto &y : s) {
                st0.erase(y);
                que.push(y);
            }
        }
        cout << "!" << endl;
        dfs(1, 0, 1);
    }
    return 0;
}