// 23 - 12 - 23 

#include<bits/stdc++.h>

using namespace std;

#define read() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define day() time_t now = time(0);char* x = ctime(&now);cerr<<"Right Now Is : "<<x<<"\n"

#define ii pair<int,int>
#define X first
#define Y second 

const long long MAX = (int)1e5 + 5;
const long long INF = (int)1e9;
const long long MOD = (int)1e9 + 7;

int n;
vector<ii> red,blue;
vector<int> r,b;
deque<int> rx,bx;

signed main(){
	
	read();
	
	cin >> n;
	
	for(int i = 2;i <= n;i++){
		cout << "? " << 1 << " " << i << endl;
		char x;
		cin >> x;
		if(x == 'R'){
			red.push_back({1,i});
			if(r.size() == 0)r.push_back(1);
			r.push_back(i);
			rx.push_back(i);
		}else{
			blue.push_back({1,i});
			if(r.size() == 0)b.push_back(1);
			b.push_back(i);
			bx.push_back(i);
		}
		//dental.push_back(i);
	}	
	
	while((int)r.size() != n && (int)b.size() != n - 1){
		int u = rx.back();
		int v = bx.back();
		
		cout << "? " << u << " " << v << endl;
		char x;
		cin >> x;
		
		if(x == 'R'){
			bx.pop_back();
			r.push_back(v);
			red.push_back({u,v});
		}else{
			rx.pop_back();
			b.push_back(u);
			blue.push_back({u,v});
		}
	}
	
	if((int)r.size() == n){
		cout << "!\n";
		for(auto v : red)cout << v.X << " " << v.Y << "\n";
		cout << endl;
	}else if((int)b.size() == n){
		cout << "!\n";
		for(auto v : blue)cout << v.X << " " << v.Y << "\n";
		cout << endl;
	}
		
		
	
}