#include <bits/stdc++.h>

using namespace std;
const int N = 50005;
int n, nowcol;
int conn[3][N];	 //
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int query(int u, int v)
{
	cout << "? " << u << " " << v << endl;
	char ch;
	cin >> ch;
	if (ch == 'R')
		return 1;
	else
		return 2;
}
stack<int> stk;
signed main()
{
	cin >> n;
	stk.push(1);
	for (int i = 2; i <= n; i++) {
		int res = query(stk.top(), i);
		if (stk.size() == 1 || res == nowcol) {
			stk.push(i);
			nowcol = res;
		}
		else {
			int j = stk.top();
			stk.pop();
			conn[nowcol][j] = stk.top();
			conn[3 - nowcol][j] = i;
			i--;
		}
	}
	cout << "!" << endl;
	while (stk.size() >= 2) {
		int j = stk.top();
		stk.pop();
		cout << j << " " << stk.top() << endl;
	}
	for (int i = 1; i <= n; i++) {
		if (conn[nowcol][i]) {
			cout << i << " " << conn[nowcol][i] << endl;
		}
	}
	return 0;
}