#include <bits/stdc++.h>

#define ll long long
#define mod 1000000007

using namespace std;

char query(int x, int y){
    cout << "? " << x + 1 << " " << y + 1 << endl;
    //cout.flush();
    char res;
    cin >> res;
    return res;
}

void answer(vector<vector<int> > res){
    cout << "!" << endl;
    for(int i = 0; i < res.size(); i++)
        cout << res[i][0] + 1 << " " << res[i][1] + 1 << endl;
}

int n;
vector<vector< vector<int> > > adj(2);
vector<vector<int> > target(2);             // target[0]: 0->i có màu R ;    target[1]: 0->i có màu B
pair<int, int> pos = {1, 1};

void Krusal(){
    target[0].emplace_back(0);
    target[1].emplace_back(0);
    
    for(int i = 1; i < n; i++){
        char res = query(0, i);
        if(res == 'R'){
            target[0].emplace_back(i);
            adj[0].push_back({0, i});
        }
        else{
            target[1].emplace_back(i);
            adj[1].push_back({0, i});
        }
    }

    while(max(adj[0].size(), adj[1].size()) < n - 1){
        int u = target[0][pos.first], v = target[1][pos.second];
        char res = query(u, v);
        if(res == 'R'){
            adj[0].push_back({u, v});
            pos.second++;
        }
        else{
            adj[1].push_back({u, v});
            pos.first++;
        }
    }

    if(adj[0].size() == n - 1) answer(adj[0]);
    else answer(adj[1]);
}

void solve(){
    cin >> n;
    Krusal();
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}