//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int fa1[50005],fa2[50005];
set<pii> st1[50005],st2[50005];
set<int> nd1[50005],nd2[50005];
int n1[50005],n2[50005];
int siz1[50005],siz2[50005];
inline int anc1(int x)
{
	while(fa1[x]!=x) x=fa1[x]=fa1[fa1[x]];
	return x;
}
inline int anc2(int x)
{
	while(fa2[x]!=x) x=fa2[x]=fa2[fa2[x]];
	return x;
}
vector<pii> E1,E2;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int N;
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		fa1[i]=fa2[i]=i;
		st1[i].emplace(i,i);
		st2[i].emplace(i,i);
		n1[i]=n2[i]=1;
		siz1[i]=siz2[i]=1;
		nd1[i].insert(i);
		nd2[i].insert(i);
	}
	pair<pii,int> pr=mp(mp(1,1),1);
	while(sz(E1)<N-1&&sz(E2)<N-1)
	{
		int c=pr.second;
		int x=pr.first.second;
		if(c==1)
		{
			pii pr1=*st1[x].begin();
			pii pr2=*st1[x].rbegin();
			while(anc1(n1[x])==x) n1[x]++;
			int a=n1[x];
			int b;
			if(anc2(pr1.second)==anc2(a))
				b=pr2.second;
			else
				b=pr1.second;
			cout<<"? "<<a<<" "<<b<<endl;
			char ch;
			cin>>ch;
			if(ch=='R')
			{
				E1.pb(a,b);
				a=anc1(a);
				b=anc1(b);
				if(siz1[a]>siz1[b]) swap(a,b);
				fa1[a]=b;
				siz1[b]+=siz1[a];
				pr=max(pr,mp(mp(siz1[b],b),1));
				for(auto x:nd1[a])
				{
					nd1[b].insert(x);
					int y=anc2(x);
					st2[y].erase(mp(a,x));
					st2[y].insert(mp(b,x));
				}
				for(auto pr:st1[a])
					st1[b].insert(pr);
				st1[a].clear();
				nd1[a].clear();
			}
			else
			{
				E2.pb(a,b);
				a=anc2(a);
				b=anc2(b);
				if(siz2[a]>siz2[b]) swap(a,b);
				fa2[a]=b;
				siz2[b]+=siz2[a];
				pr=max(pr,mp(mp(siz2[b],b),2));
				for(auto x:nd2[a])
				{
					nd2[b].insert(x);
					int y=anc1(x);
					st1[y].erase(mp(a,x));
					st1[y].insert(mp(b,x));
				}
				for(auto pr:st2[a])
					st2[b].insert(pr);
				st2[a].clear();
				nd2[a].clear();
			}
		}
		else
		{
			pii pr1=*st2[x].begin();
			pii pr2=*st2[x].rbegin();
			while(anc2(n2[x])==x) n2[x]++;
			int a=n2[x];
			int b;
			if(anc1(pr1.second)==anc1(a))
				b=pr2.second;
			else
				b=pr1.second;
			cout<<"? "<<a<<" "<<b<<endl;
			char ch;
			cin>>ch;
			if(ch=='R')
			{
				E1.pb(a,b);
				a=anc1(a);
				b=anc1(b);
				if(siz1[a]>siz1[b]) swap(a,b);
				fa1[a]=b;
				siz1[b]+=siz1[a];
				pr=max(pr,mp(mp(siz1[b],b),1));
				for(auto x:nd1[a])
				{
					nd1[b].insert(x);
					int y=anc2(x);
					st2[y].erase(mp(a,x));
					st2[y].insert(mp(b,x));
				}
				for(auto pr:st1[a])
					st1[b].insert(pr);
				st1[a].clear();
				nd1[a].clear();
			}
			else
			{
				E2.pb(a,b);
				a=anc2(a);
				b=anc2(b);
				if(siz2[a]>siz2[b]) swap(a,b);
				fa2[a]=b;
				siz2[b]+=siz2[a];
				pr=max(pr,mp(mp(siz2[b],b),2));
				for(auto x:nd2[a])
				{
					nd2[b].insert(x);
					int y=anc1(x);
					st1[y].erase(mp(a,x));
					st1[y].insert(mp(b,x));
				}
				for(auto pr:st2[a])
					st2[b].insert(pr);
				st2[a].clear();
				nd2[a].clear();
			}
		}
	}
	if(sz(E1)==N-1)
	{
		cout<<"!"<<endl;
		for(auto pr:E1)
			cout<<pr.first<<" "<<pr.second<<endl;
	}
	else
	{
		cout<<"!"<<endl;
		for(auto pr:E2)
			cout<<pr.first<<" "<<pr.second<<endl;
	}
	return 0;
}