#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 5e4 + 5;
vector<int> adj[maxn][2];
bool qry(int i, int j) {
    cout << "? " << i << " " << j << endl;
    char x;
    cin >> x;
    bool c = (x == 'R');
    adj[i][c].push_back(j); adj[j][c].push_back(i);
    return c;
}

int n;
int fa[maxn][2], lb[maxn][2];
int rt(int u, int i) {
    if (fa[u][i]==u) return u;
    return fa[u][i] = rt(fa[u][i], i);
}
void merge(int u, int v, int i) {
    if (u > v) swap(u, v);
    lb[v][i] = lb[u][i];
    fa[u][i] = v;
}

bool vis[maxn][2];
void dfs(int u, int i) {
    vis[u][i] = true;
    for (int v:adj[u][i]) if (!vis[v][i]) {
        cout << u << " " << v << endl;
        dfs(v, i);
    }
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int i=1;i<=n;i++) fa[i][0] = fa[i][1] = lb[i][0] = lb[i][1] = i;
    for (int i=2;i<=n;i++) {
        while (lb[i][0]!=1 && lb[i][1]!=1) {
            int nxt = min(lb[i][0], lb[i][1]) - 1;
            bool c = qry(i, nxt);
            merge(nxt, i, c);
        }
    }
    int c = 0;
    if (lb[n][0]!=1) c = 1;
    cout << "!" << endl;
    dfs(1, c);
}