#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dou;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mapa make_pair
typedef long double ld;
typedef unsigned long long ull;
#define ep emplace_back
template <typename T>inline void read(T &x){
	x=0;char c=getchar();bool f=0;
	for(;c<'0'||c>'9';c=getchar()) f|=(c=='-');
	for(;c>='0'&&c<='9';c=getchar())
	x=(x<<1)+(x<<3)+(c^48);
	x=(f?-x:x);
}
const int N=50005;
int n;
int fa[N], fb[N];
inline int ga(int x){
	while(x!=fa[x]) x=fa[x]=fa[fa[x]];
	return x;
}
inline int gb(int x){
	while(x!=fb[x]) x=fb[x]=fb[fb[x]];
	return x;
}
char str[2];
vector<pii> va, vb;
int fai, fbi, faj, fbj;
int main(){
	// freopen("D:\\nya\\acm\\A\\test.in","r",stdin);
	// freopen("D:\\nya\\acm\\A\\test.out","w",stdout);
	scanf("%d", &n);
	for(int i=1; i<=n; ++i) fa[i]=fb[i]=i;
	for(int i=1; i<n; ++i){
		fai=ga(i); fbi=gb(i);
		for(int j=i+1; j<=n; ++j){
			faj=ga(j); 
			if(fai^faj){
				fbj=gb(j);
				if(fbi^fbj){
					printf("? %d %d\n", i, j);
					fflush(stdout);
					scanf("%s", str);
					if(str[0]=='R'){
						fa[fai]=faj;
						va.ep(i, j);
						if((int)va.size()==n-1){
							printf("!\n");
							for(auto t:va) printf("%d %d\n", t.fi, t.se);
							return 0;
						}
					}
					else{
						fb[fbi]=fbj;
						vb.ep(i, j);
						if((int)vb.size()==n-1){
							printf("!\n");
							for(auto t:vb) printf("%d %d\n", t.fi, t.se);
							return 0;
						}
					}
					fai=ga(i); fbi=gb(i);
				}
			}
		}
	}
	return 0;
}