#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long

using namespace std;
bool ask(int i, int j)
{
    char flag;
    cout << "? " << i << " " << j << endl;
    cin >> flag;
    if (flag == 'R')
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
queue<int> qu0;
queue<int> qu1;
vector<pair<int, int>> ve1, ve0;
void solve()
{
    int n;
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        if (ask(1, i))
        {
            qu1.push(i);
            ve1.push_back({ 1, i });
        }
        else
        {
            qu0.push(i);
            ve0.push_back({ 1, i });
        }
    }
    if (qu1.empty())
    {
        cout << "!" << endl;
        for (int i = 0; i < ve0.size(); i++)
        {
            cout << ve0[i].first << " " << ve0[i].second << endl;
        }
        return;
    }
    if (qu0.empty())
    {
        cout << "!" << endl;
        for (int i = 0; i < ve1.size(); i++)
        {
            cout << ve1[i].first << " " << ve1[i].second << endl;
        }
        return;
    }
    int a1, a0;
    while (!qu1.empty() && !qu0.empty())
    {
        a1 = qu1.front();
        a0 = qu0.front();
        qu1.pop();
        qu0.pop();

        if (ask(a1, a0))
        {
            ve1.push_back({ a1,a0 });
            qu1.push(a1);
        }
        else
        {
            ve0.push_back({ a1, a0 });
            qu0.push(a0);
        }
    }
    if (qu1.empty())
    {
        cout << "!" << endl;
        for (int i = 0; i < ve0.size(); i++)
        {
            cout << ve0[i].first << " " << ve0[i].second << endl;
        }
        return;
    }
    if (qu0.empty())
    {
        cout << "!" << endl;
        for (int i = 0; i < ve1.size(); i++)
        {
            cout << ve1[i].first << " " << ve1[i].second << endl;
        }
        return;
    }
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}