#include<bits/stdc++.h>
#define FIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define eb emplace_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N=5e4+5;

int n,fa[2][N];
int find(int o,int x){return x==fa[o][x]?x:fa[o][x]=find(o,fa[o][x]);}
void uty(int o,int x,int y){fa[o][find(o,x)]=find(o,y);}

bool ask(int x,int y){
	cout<<"? "<<x<<' '<<y<<endl;
	char o; cin>>o;
	return (o=='B');
}
set<int> vec[2];
vector<pii> edges[2];

signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;++i) fa[0][i]=fa[1][i]=i;
	for(int i=2;i<=n;++i){
		bool o=ask(1,i);
		uty(o,i,1),edges[o].eb(1,i);
	}
	int l=2,r=2;
	while((int)max(edges[0].size(),edges[1].size())<n-1){
		while(find(0,l)==find(0,1)) ++l;
		while(find(1,r)==find(1,1)) ++r;
		bool o=ask(l,r);
		uty(o,l,r),edges[o].eb(l,r); 
	}
	
	int o=((int)edges[0].size()==n-1?0:1);
	cout<<"!"<<endl;
	for(auto h:edges[o]) cout<<h.fi<<' '<<h.se<<endl;
	return 0;
}