#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N=2e5+10;
int n;
vector<int> remain[2];
vector<pii> path[2];
int st[2][N];
int query(int u,int v){
    cout<<"? "<<u<<' '<<v<<endl;
    string s;cin>>s;
    return s=="R";
}
void answer(){
    cout<<"!\n";
    int res=!remain[0].empty();
    for(auto &[x,y]:path[res]){
        cout<<x<<' '<<y<<endl;
    }
}
int main(){
    cin>>n;
    st[0][1]=1;
    st[1][1]=1;
    for(int i=2;i<=n;i++){
        bool res=query(1,i);
        path[res].push_back({1,i});
        st[res][i]=1;
    }
    for(int i=1;i<=n;i++){
        if(!st[0][i]) remain[0].push_back(i);
        if(!st[1][i]) remain[1].push_back(i);
    }

    while(remain[0].size() && remain[1].size()){
        int a1=remain[0].back(),b1=remain[1].back();
        bool tp=query(a1,b1);
        remain[tp].pop_back();
        path[tp].push_back({a1,b1});
    }
    answer();
    return 0;
}