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

    while(a.size()!=n && b.size()!=n){
        int a1=remainA.back(),b1=remainB.back();
        bool tp=query(a1,b1);
        if(tp){
            remainA.pop_back();
            a.push_back(a1);
            ar.push_back({a1,b1});
        }else{
            remainB.pop_back();
            b.push_back(b1);
            br.push_back({a1,b1});
        }

    }
    answer();
    return 0;
}