#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define fi first
#define pll pair<ll, ll>
#define se second
#define lll __int128
#define ld long double
#define all(a) a.begin() + 1, a.end()
#define iofast                   \
    ios::sync_with_stdio(false); \
    cin.tie(0), cout.tie(0)
#define lowbit(i) (i & (-i))
using namespace std;
const int maxn = 1e6 + 5, mod = 1000000007;
struct DSU
{
    std::vector<int> p, siz;
    DSU(int n) : p(n + 1), siz(n + 1, 1) { std::iota(p.begin(), p.end(), 0); }
    int find(int x)
    {
        while (x != p[x])
            x = p[x] = p[p[x]];
        return x;
    }
    bool same(int x, int y) { return find(x) == find(y); }
    bool merge(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x == y)
            return 0;
        siz[x] += siz[y];
        p[y] = x;
        return true;
    }
    int size(int x) { return siz[find(x)]; }
};
void solve()
{
    int n;
    cin >> n;
    DSU dsu1(n), dsu2(n);
    vector<int> a, b;
    a.push_back(1);
    b.push_back(1);
    char ret;
    vector<pii> tonga, tongb;
    for (int i = 2; i <= n; i++)
    {
        cout << "? 1 " << i << endl;
        cin >> ret;
        if (ret == 'R')
        {
            tonga.push_back(pair{1, i});
            dsu1.merge(1, i);
            b.push_back(i);
        }
        else
        {
            tongb.emplace_back(1, i);
            dsu2.merge(1, i);
            a.push_back(i);
        }
    }
    while (a.size() > 1 && b.size() > 1)
    {
        cout << "? " << a.back() << " " << b.back() << endl;
        cin >> ret;
        if (ret == 'R')
        {
            tonga.emplace_back(a.back(), b.back());
            a.pop_back();
        }
        else
        {
            tongb.emplace_back(a.back(), b.back());
            b.pop_back();
        }
    }
    if (b.size() == 1)
        swap(tonga, tongb);
    cout << "!" << endl;
    for (auto [i, j] : tonga)
    {
        cout << i << " " << j << endl;
    }
}
int main()
{
    iofast;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    // cout << endl;
    //  system("pause");
}