#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<set>
using namespace std;
set<int>s[4];
int fa[100050][2];
bool qus(int a,int b){
    cout<<"? "<<a<<" "<<b<<endl;
    char ch;cin>>ch;
    return ch=='R';
}
int main(){
    int n;cin>>n;
    for(int i=2;i<=n;i++){
        if(qus(1,i)){
            s[1].insert(i);
            fa[i][1]=1;
        }
        else{
            s[0].insert(i);
            fa[i][0]=1;
        }
    }
    while((!s[0].empty())&&(!s[1].empty())){
        auto a=*s[0].begin(),b=*s[1].begin();
        if(qus(a,b)){
            s[0].erase(a);
            fa[a][1]=b;
        }else{
            s[1].erase(b);
            fa[b][0]=a;
        }
    }
    cout<<"!"<<endl;
    if(s[0].empty()){
        for(int i=2;i<=n;i++){
            cout<<i<<" "<<fa[i][1]<<endl;
        }
    }else{
        for(int i=2;i<=n;i++){
            cout<<i<<" "<<fa[i][0]<<endl;
        }
    }
    //s1仅存于1树
    //s2仅存于2树
}