//#define NDEBUG
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForD(i,j,k) for(int i=(j);i>=(k);--i)
#define int long long
using namespace std;
bool Mbe;
const int N=5e4+5;
int fa[2][N];
int query(int a,int b){
    cout<<"? "<<a<<' '<<b<<endl;
    char x; cin>>x;
    if(x=='B') return 0;
    return 1;
}
vector<int> V[2];
#define pb push_back
void solve(){
    int n; cin>>n;
    For(i,2,n){
        int c=query(1,i);
        fa[c][i]=1,V[c].pb(i);
    }
    while(!V[0].empty()&&!V[1].empty()){
        int x=V[0].back(),y=V[1].back();
        int c=query(x,y);
        if(c) fa[c][x]=y,V[0].pop_back();
        else fa[c][y]=x,V[1].pop_back();
    }
    int c=(!V[0].empty()?0:1);
    cout<<"! "<<endl;
    For(i,2,n) cout<<i<<' '<<fa[c][i]<<endl;
}
bool Med;
signed main(){
	fprintf(stderr,"%.3lf MB\n",(&Mbe-&Med)/1048576.0);
	ios::sync_with_stdio(false); cin.tie(0),cout.tie(0);
	int _=1;
	// cin>>_;
	while(_--) solve();
	cerr<<1e3*clock()/CLOCKS_PER_SEC<<" ms\n";
	return 0;
}