#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define fi first
#define se second
typedef long long LL;
typedef pair<int, int> pi;
int main() {
    int n; cin >> n;
    if(n == 1) {
        cout << "!" << endl;
        return 0;
    }
    V<V<int>> e[]{V<V<int>>(n + 1), V<V<int>>(n + 1)};
    auto get_val = [&](char c) -> int {
        if(c == 'R') return 1;
        return 0;
    };
    auto query = [&](int x, int y) -> int {
        cout  << "? " << x << " " << y << endl;
        char c; cin >> c;
        return get_val(c);
    };
    auto add_edge = [&](int x, int y, int c) -> void {
        e[c][x].pb(y);
        e[c][y].pb(x);
    };
    V<int> hav[2];
    for(int i = 2; i <= n; i++) {
        int t = query(1, i);
        hav[t].pb(i);
        add_edge(1, i, t);
    }
    while(hav[1].size() && hav[0].size()) {
        int x = hav[1].back(), y = hav[0].back();
        int t = query(x, y);
        add_edge(x, y, t);
        hav[t ^ 1].pop_back();
    }
    for(int i = 0; i < 2; i++) {
        if(hav[i].size()) {
            cout << "! " << endl;
            V<int> vis(n + 1);
            V<pi> ans;
            auto dfs = [&](int x, auto dfs) -> void {
                vis[x] = 1;
                for(auto y : e[i][x]) {
                    if(vis[y]) continue;
                    ans.pb({x, y});
                    dfs(y, dfs);
                }
            };
            dfs(1, dfs);
            for(auto [u, v] : ans) cout << u << " " << v << endl;
        }
    }
}