#include <iostream>
#include <vector>
#include <string>
#include <set>

using namespace std;
using ll = long long;

struct Dsu {
    vector<int> root;
    set<int> roots;
    vector<pair<int, int>> edges;
    int component;

    Dsu(int n): root(n + 1), roots(), component(n) {
        for (int i = 1; i <= n; i++) {
            root[i] = i;
            roots.insert(i);
        }
    }

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

    int _merge(int x, int y) {
        int x_ = find(x), y_ = find(y);
        if (x_ == y_) {
            return false;
        }
        if (x_ > y_) {
            swap(x_, y_);
        }
        root[y_] = x_;
        roots.erase(y_);
        edges.emplace_back(x, y);
        return true;
    }

    void merge(int x, int y) {
        component -= _merge(x, y);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> ess;
    Dsu r(n), b(n);
    char prev = -1, first = -1;
    for (int i = 1; i <= n; i++) {
        cout << "? " << i << " " << i % n + 1 << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, i % n + 1);
        } else {
            b.merge(i, i % n + 1);
        }
    }
    while (r.component != 1 && b.component != 1) {
        int i = *next(r.roots.begin());
        int j = *next(b.roots.begin());
        if (b.find(1) != b.find(i)) {
            j = 1;
        } else if (r.find(1) != r.find(j)) {
            i = 1;
        }
        cout << "? " << i << " " << j << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, j);
        } else {
            b.merge(i, j);
        }
    }
    if (r.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : r.edges) {
            cout << u << " " << v << "\n";
        }
    } else if (b.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : b.edges) {
            cout << u << " " << v << "\n";
        }
    }

    return 0;
}
/*#include <iostream>
#include <vector>
#include <string>
#include <set>

using namespace std;
using ll = long long;

struct Dsu {
    vector<int> root;
    set<int> roots;
    vector<pair<int, int>> edges;
    int component;

    Dsu(int n): root(n + 1), roots(), component(n) {
        for (int i = 1; i <= n; i++) {
            root[i] = i;
            roots.insert(i);
        }
    }

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

    int _merge(int x, int y) {
        int x_ = find(x), y_ = find(y);
        if (x_ == y_) {
            return false;
        }
        if (x_ > y_) {
            swap(x_, y_);
        }
        root[y_] = x_;
        roots.erase(y_);
        edges.emplace_back(x, y);
        return true;
    }

    void merge(int x, int y) {
        component -= _merge(x, y);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> ess;
    Dsu r(n), b(n);
    char prev = -1, first = -1;
    for (int i = 1; i <= n; i++) {
        cout << "? " << i << " " << i % n + 1 << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, i % n + 1);
        } else {
            b.merge(i, i % n + 1);
        }
    }
    while (r.component != 1 && b.component != 1) {
        int i = *next(r.roots.begin());
        int j = *next(b.roots.begin());
        if (b.find(1) != b.find(i)) {
            j = 1;
        } else if (r.find(1) != r.find(j)) {
            i = 1;
        }
        cout << "? " << i << " " << j << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, j);
        } else {
            b.merge(i, j);
        }
    }
    if (r.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : r.edges) {
            cout << u << " " << v << "\n";
        }
    } else if (b.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : b.edges) {
            cout << u << " " << v << "\n";
        }
    }

    return 0;
}#include <iostream>
#include <vector>
#include <string>
#include <set>

using namespace std;
using ll = long long;

struct Dsu {
    vector<int> root;
    set<int> roots;
    vector<pair<int, int>> edges;
    int component;

    Dsu(int n): root(n + 1), roots(), component(n) {
        for (int i = 1; i <= n; i++) {
            root[i] = i;
            roots.insert(i);
        }
    }

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

    int _merge(int x, int y) {
        int x_ = find(x), y_ = find(y);
        if (x_ == y_) {
            return false;
        }
        if (x_ > y_) {
            swap(x_, y_);
        }
        root[y_] = x_;
        roots.erase(y_);
        edges.emplace_back(x, y);
        return true;
    }

    void merge(int x, int y) {
        component -= _merge(x, y);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> ess;
    Dsu r(n), b(n);
    char prev = -1, first = -1;
    for (int i = 1; i <= n; i++) {
        cout << "? " << i << " " << i % n + 1 << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, i % n + 1);
        } else {
            b.merge(i, i % n + 1);
        }
    }
    while (r.component != 1 && b.component != 1) {
        int i = *next(r.roots.begin());
        int j = *next(b.roots.begin());
        if (b.find(1) != b.find(i)) {
            j = 1;
        } else if (r.find(1) != r.find(j)) {
            i = 1;
        }
        cout << "? " << i << " " << j << endl;
        string z;
        cin >> z;
        if (z[0] == 'R') {
            r.merge(i, j);
        } else {
            b.merge(i, j);
        }
    }
    if (r.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : r.edges) {
            cout << u << " " << v << "\n";
        }
    } else if (b.component == 1) {
        cout << "!" << "\n";
        for (auto [u, v] : b.edges) {
            cout << u << " " << v << "\n";
        }
    }

    return 0;
}*/