//Linkwish's code
#include<bits/stdc++.h>
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=1e9;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	ci N=50005;

	int n;
	bool col[N];
	vector<int> e[N],g[N];
	si void adde(int x,int y){
		e[x].push_back(y);
		e[y].push_back(x);
	}
	si void addg(int x,int y){
		g[x].push_back(y);
		g[y].push_back(x);
	}

	map<pii,bool> vis;

	si bool ask(int x,int y){
		if(vis.count(minmax(x,y)))return vis[minmax(x,y)];
		cout<<"? "<<x<<' '<<y<<endl;
		char res;cin>>res;
		return vis[minmax(x,y)]=(res=='R');
	}

	bool got[N];
	void dfsg(int x){
		got[x]=true;
		for(int to:g[x]){
			if(!got[to]){
				cout<<x<<' '<<to<<endl;
				dfsg(to);
			}
		}
	}
	void dfse(int x){
		got[x]=true;
		for(int to:e[x]){
			if(!got[to]){
				cout<<x<<' '<<to<<endl;
				dfse(to);
			}
		}
	}

	si void solve(){
		cin>>n;
		vector<int> p,q;
		for(int i=2;i<=n;i++){
			if(ask(1,i))q.push_back(i),addg(1,i);
			else p.push_back(i),adde(1,i);
		}
		auto i=p.begin(),j=q.begin();
		bool side=0;
		while(i!=p.end()&&j!=q.end()){
			if(side){
				for(;i!=p.end()&&ask(*i,*j);i++)addg(*i,*j);
				if(i==p.end()){
					cout<<"!\n";
					dfsg(1);
					break;
				}
			}
			else{
				for(;j!=q.end()&&!ask(*i,*j);j++)adde(*i,*j);
				if(j==q.end()){
					cout<<"!\n";
					dfse(1);
					break;
				}
			}
			side^=1;
		}
	}

	void mian(){
		solve();
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	// assert(freopen("in.in","r",stdin));
	// assert(freopen("out.out","w",stdout));
	// assert(freopen("out.err","w",stderr));
	#endif
	LinkWish::mian();
	return 0;
}