#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")




int ask(int u, int v) {
  printf("? %d %d\n", u, v);
  fflush(stdout);
  char c;
  scanf(" %c", &c);
  return string("BR").find(c);
}

int main() {
  int N;
  scanf("%d", &N);
  
  // representatives
  vector<int> uss[2];
  vector<pair<int, int>> ess[2];
  for (int h = 0; h < 2; ++h) {
    uss[h] = {1};
  }
  for (int u = 2; u <= N; ++u) {
    for (int h = 0; h < 2; ++h) if (uss[h].size() == 1) {
      uss[h].push_back(u);
      for (; uss[h ^ 1].size(); ) {
        const int v = uss[h ^ 1].back();
        const int res = ask(u, v);
        ess[res].emplace_back(u, v);
        if (h == res) {
          uss[h] = {u};
          break;
        } else {
          uss[h ^ 1].pop_back();
        }
      }
      uss[h ^ 1].push_back(u);
      goto done;
    }
    assert(false);
   done:{}
// cerr<<"done u = "<<u<<": uss = ";pv(uss,uss+2);
  }
  
  for (int h = 0; h < 2; ++h) if (uss[h].size() == 1) {
    puts("!");
    for (const auto &e : ess[h]) {
      printf("%d %d\n", e.first, e.second);
    }
    fflush(stdout);
    return 0;
  }
  assert(false);
  return 0;
}