#include <bits/stdc++.h>
#define ll long long
#define log(x) (63^__builtin_clzll(x))
#define pii pair<ll,ll>
using namespace std;
vector<pii>B,R;
bool qry(int x,int y){
	cout<<"? "<<x<<" "<<y<<endl;
	char c;
	cin>>c;
	if(c=='R')R.push_back({x,y});
	else B.push_back({x,y});
	return c=='R';
}
int f[200005];
int find(int x){
	return f[x]==x?x:f[x]=find(f[x]);
}
void solve(){
	int n;
	cin>>n;
	queue<int>b,r;
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=2;i<=n;i++){
		if(qry(1,i))r.push(i);
		else b.push(i);
	}
	while(!r.empty()&&!b.empty()){
		if(qry(r.front(),b.front()))b.pop();
		else r.pop();
	}
	cout<<"!"<<endl;
	if(b.empty()){
		for(auto u:R){
			if(find(u.first)!=find(u.second)){
				f[find(u.first)]=u.second;
				cout<<u.first<<" "<<u.second<<endl;
			}
		}
	}
	else{
		for(auto u:B){
			if(find(u.first)!=find(u.second)){
				f[find(u.first)]=u.second;
				cout<<u.first<<" "<<u.second<<endl;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	// cin>>t;
	while(t--)solve();
	return 0;
}
/*

*/