#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>

using namespace std;

int ask(int x, int y) {
  cout << "? " << x << " " << y << endl;

  char ch;
  cin >> ch;

  return ch == 'B';
}

void print(vector<pair<int, int>> &v) {
  cout << "! " << "\n";
  for (auto it : v) {
    cout << it.first << " " << it.second << "\n";
  }

  cout.flush();
}


void solve() {
  int n;
  cin >> n;

  vector<int> s[2];
  vector<vector<pair<int, int>>> v(2);
  for (int i = 2; i <= n; ++i) {
    int x = ask(1, i);
    v[x].push_back({1, i});
    s[x].push_back(i);
  }

  while (!s[0].empty() && !s[1].empty()) {
    int r = ask(s[0].back(), s[1].back());
    v[r].push_back({s[0].back(), s[1].back()});
    s[1 - r].pop_back();
  }

  if (!s[0].empty()) {
    print(v[0]);
  } else {
    print(v[1]);
  }
}

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

  int t = 1;
  while (t--)
    solve();

  return 0;
}