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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

struct DSU
{
	int n;
	VI p, sz;
	
	DSU(int _n = 0) 
	{
		n = _n;
		p.resize(n);
		iota(ALL(p), 0);
		sz.assign(n, 1);
	}
	int find(int v)
	{
		if (v == p[v])
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if (u == v) 
			return false;
		if (sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
} dsu[2];

vector<VI> g[2];

int ask(int u, int v)
{
	cout << "? " << u + 1 << " " << v + 1 << endl;
	char c;
	cin >> c;
	int res = c == 'B';
	g[res][u].PB(v);
	g[res][v].PB(u);
	return res;
}

void dfs(int c, int p, int v)
{
	if (p != -1)
	{
		cout << p + 1 << " " << v + 1 << endl;
	}
	for (int to : g[c][v])
	{
		if (to == p)
			continue;
		dfs(c, v, to);
	}
}

int main()
{
	//ios::sync_with_stdio(0); 
	//cin.tie(0);
	int n;
	cin >> n;
	FOR(i, 0, 2)
	{
		dsu[i] = DSU(n);
		g[i].resize(n);
	}
	int c = 0;
	vector<set<int>> comps(2);
	FOR(i, 0, n)
	{
		bool w = false;
		while (!comps[c ^ 1].empty())
		{
			int v = *comps[c ^ 1].begin();
			int col = ask(v, i);
			comps[col].erase(dsu[col].find(v));
			dsu[col].unite(v, i);
			if (col == c)
			{
				w = true;
				break;
			}
		}
		if (!w)
			c ^= 1;
		FOR(j, 0, 2)
			comps[j].insert(dsu[j].find(i));
	}
	FOR(j, 0, 2)
	{
		if (dsu[j].sz[dsu[j].find(0)] < n)
			continue;
		cout << "!\n";
		dfs(j, -1, 0);
		return 0;
	}
	assert(false);
	return 0;
}