#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second 
typedef vector<int> vi;
typedef pair<int,int> pi;

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	#ifndef ONLINE_JUDGE
	// assert(freopen(".in","r",stdin));
	// assert(freopen(".out","w",stdout));
	#endif

	auto ask=[&](int u,int v){
		cout<<"? "<<u<<' '<<v<<endl;
		char get; cin>>get;
		return (get=='R');
	};

	int n; cin>>n;
	vi R, B;
	vector<pi> Re, Be;
	rep(i,2,n){
		if(ask(1,i)){
			B.pb(i);
			Be.pb(1,i);
		}
		else{
			R.pb(i);
			Re.pb(1,i);
		}
	}
	while(!R.empty() && !B.empty()){
		int x=R.back(), y=B.back();
		if(ask(x,y)){
			Be.pb(x, y);
			R.pop_back();
		}
		else{
			Re.pb(x,y);
			B.pop_back();
		}
	}
	cout<<"!"<<endl;
	if((int)Re.size()==n-1){
		for(pi x:Re){
			cout<<x.fi<<' '<<x.se<<endl;
		}
	}
	else{
		for(pi x:Be){
			cout<<x.fi<<' '<<x.se<<endl;
		}
	}
}