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

using pii = pair<int, int>;
const int N = 5e4 + 10;

int n, fr[N], fb[N];

int find(int fa[], int x) {return fa[x] ? fa[x] = find(fa, fa[x]) : x;}

vector<pii> er, eb;

char ask(int u, int v) {
    assert(find(fr, u) != find(fr, v) && find(fb, u) != find(fb, v));
    cout << "? " << u << " " << v << endl;
    char c;
    cin >> c;
    assert(c != 'F');
    if(c == 'R') {
        er.emplace_back(u, v);
        fr[find(fr, u)] = v;
    }
    else {
        eb.emplace_back(u, v);
        fb[find(fb, u)] = v;
    }
    return c;
}

int main() {
    cin >> n;
    char tar = 'R';
    vector<int> vi;
    for(int i = 2; i <= n; i ++) {
        char c = ask(i - 1, i);
        if(c == tar) vi.push_back(i - 1);
        else{
            while(vi.size()) {
                char d = ask(vi.back(), i);
                if(d == tar) break;
                vi.pop_back();
            }
            if(vi.empty()) {
                tar = 'R' ^ 'B' ^ tar;
                vi.push_back(i - 1);
            }
        }
    }
    cout << "!" << endl;
    if(tar == 'R') {
        for(auto &[u, v] : er) cout << u << " " << v << endl;
    }else for(auto &[u, v] : eb) cout << u << " " << v << endl;
}