#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 50000 + 5;

int N;
vector <int> b, r;
vector <pair <int, int>> ansb, ansr;

char ask(int i, int j) {
    printf("? %d %d\n", i, j);
    fflush(stdout);
    char res[5];
    scanf("%s", res);
    if (res[0] == 'F') exit(0);
    return res[0];
}

void Answer(const vector <pair <int, int>> &edge) {
    printf("!\n");
    for (auto [x, y] : edge) printf("%d %d\n", x, y);
    fflush(stdout);
}

int main() {
    scanf("%d", &N);
    for (int i = 2; i <= N; i ++) {
        char col = ask(1, i);
        if (col == 'B') {
            b.push_back(i);
            ansb.emplace_back(1, i);
        }else {
            r.push_back(i);
            ansr.emplace_back(1, i);
        }
    }
    while (!(b.empty() || r.empty())) {
        int x = b.back(), y = r.back();
        char res = ask(x, y);
        if (res == 'B') {
            ansb.emplace_back(x, y);
            r.pop_back();
        }else {
            ansr.emplace_back(x, y);
            b.pop_back();
        }
    }
    if (b.empty()) {
        assert((int)ansr.size() == N - 1);
        Answer(ansr);
    }else {
        assert((int)ansb.size() == N - 1);
        Answer(ansb);
    }
    
    return 0;
}