#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int, int>> res_r, res_b;
    vector<int> red, blue;
    auto query = [&](int x, int y) {
        cout << "? " << x + 1 << " " << y + 1 << endl;
        char c;
        cin >> c;
        return c;
    };
    for (int i = 1; i < n; ++i) {
        auto c = query(0, i);
        if (c == 'R') {
            res_r.push_back({0, i});
            blue.push_back(i);
        } else {
            res_b.push_back({0, i});
            red.push_back(i);
        }
    }
    while (!red.empty() and !blue.empty()) {
        int x = red.back(), y = blue.back();
        auto c = query(x, y);
        if (c == 'R') {
            res_r.push_back({x, y});
            red.pop_back();
        } else {
            res_b.push_back({x, y});
            blue.pop_back();
        }
    }
    if (red.empty()) {
        cout << "!" << endl;
        for (auto [x, y] : res_r) {
            cout << x + 1 << " " << y + 1 << endl;
        }
    } else {
        cout << "!" << endl;
        for (auto [x, y] : res_b) {
            cout << x + 1 << " " << y + 1 << endl;
        }
    }
}