#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

struct UF {
	vi e;
	UF(int n) : e(n, -1) {}
	bool sameSet(int a, int b) { return find(a) == find(b); }
	int size(int x) { return -e[find(x)]; }
	int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	bool join(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return false;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
		return true;
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int n;cin>>n;
	UF r(n),b(n);
	vector<pii> re,be;
	int fat = -1;
	function<void(int,int)> test = [&](int x, int y){
		if(r.sameSet(x,y) || b.sameSet(x,y)) return;
		cout<<"? "<<x+1<<' '<<y+1<<endl;
		char c;cin>>c;
		if(c=='R') {
			r.join(x,y);
			re.pb({x,y});
			if(r.size(x) > n-20) fat=x;;
		}else{
			b.join(x,y);
			be.pb({x,y});
			if(b.size(x) > n-20) fat=x;
		}
	};
	mt19937_64 rng(time(NULL));
	while(fat==-1){
		test(rng()%n, rng()%n);
	}
	vi outside;
	if(r.size(fat) > n-20){
		rep(i,0,n) if(r.find(i)!=r.find(fat)) outside.pb(i);
	}else{
		rep(i,0,n) if(b.find(i)!=b.find(fat)) outside.pb(i);
	}
	for(int x : outside){
		rep(i,0,n) test(x,i);
	}
	vector<pii> o = r.size(0)==n ? re : be;
	cout<<"!\n";
	for(pii e : o)cout<<e.F+1<<' '<<e.S+1<<endl;
}