#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i++)
#define sz(a) int((a).size())

typedef long long li;

int ask(int u, int v) {
    cout << "? " << u + 1 << " " << v + 1 << endl;
    cout.flush();
    string res;
    cin >> res;
    if (res == "F")
        exit(0);
    return res == "R";
}

void solve() {
    int n; cin >> n;
    vector< pair<int, int> > trees[2];

    vector<int> cds[2];
    fore (i, 1, n) {
        int resp = ask(0, i);
        cds[resp].push_back(i);
        trees[resp].emplace_back(0, i);
    }

    while (sz(trees[0]) < n - 1 && sz(trees[1]) < n - 1) {
        assert(!cds[0].empty() && !cds[1].empty());
        int r = ask(cds[0].back(), cds[1].back());
        trees[r].emplace_back(cds[0].back(), cds[1].back());
        cds[r ^ 1].pop_back();
    }

    int c = 0;
    if (sz(trees[1]) > sz(trees[0]))
        c = 1;
    assert(sz(trees[c]) == n - 1);
    cout << "!" << endl;
    for (auto &[u, v] : trees[c])
        cout << u + 1 << " " << v + 1 << endl;
}

int main() {
#ifdef _DEBUG
//    freopen("input.txt", "r", stdin);
#endif
//    ios_base::sync_with_stdio(false);
//    cin.tie(NULL);

    solve();
    return 0;
}