#include<bits/stdc++.h>
using namespace std;
const int N=50010;
int n,fa1[N],fa2[N];
bool ok1[N],ok2[N];
set<int>s1,s2;
vector<pair<int,int>>e1,e2;
int find1(int x){
	return fa1[x]==x?x:fa1[x]=find1(fa1[x]);
}
int find2(int x){
	return fa2[x]==x?x:fa2[x]=find2(fa2[x]);
}
void qry(int x,int y){
	cout<<"? "<<x<<" "<<y<<endl;
	char c;
	cin>>c;
	if(c=='R'){
		if(ok1[x]){
			ok1[y]=1;
			s1.erase(y);
		}else{
			ok1[x]=1;
			s1.erase(x);
		}
		int fx=find1(x);
		int fy=find1(y);
		if(fx!=fy){
			fa1[fx]=fy;
			e1.push_back({x,y});
		}
	}else{
		if(ok2[x]){
			ok2[y]=1;
			s2.erase(y);
		}else{
			ok2[x]=1;
			s2.erase(x);
		}
		int fx=find2(x);
		int fy=find2(y);
		if(fx!=fy){
			fa2[fx]=fy;
			e2.push_back({x,y});
		}
	}
	return;
}
signed main(){
	cin>>n;
	ok1[1]=ok2[1]=1;
	for(int i=1;i<=n;i++)
		fa1[i]=fa2[i]=i;
	for(int i=2;i<=n;i++)
		s1.insert(i),
		s2.insert(i); 
	for(int i=2;i<=n;i++){
		qry(1,i);
	}
	while(1){
		if(!s1.size()){
			cout<<"!"<<endl;
			for(auto v:e1){
				cout<<v.first<<" "<<v.second<<endl;
			}
			return 0;
		}
		if(!s2.size()){
			cout<<"!"<<endl;
			for(auto v:e2){
				cout<<v.first<<" "<<v.second<<endl;
			}
			return 0;
		}
		int u=(*s1.begin()),v=(*s2.begin());
		qry(u,v);
	}
	return 0;
}