#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
  #include "debug.hpp"
#else
  #define dbg(...) 0
#endif

int make_query(int i, int j) {
  cout << (i + 1) << ' ' << (j + 1) << endl;
  int r;
  cin >> r;
  return r;
}

vector<int> inds;

int is_smaller(int i, int j) {
  int r = make_query(inds[i], inds[j]);
  if (r < 0) return -1;
  if (r == 0) return (inds[i] < inds[j]);
  assert(r == 1);
  swap(inds[i], inds[j]);
  return (inds[i] < inds[j]);
}

void make_swap(int i, int j) {
  swap(inds[i], inds[j]);
};

bool solve(int n) {
  inds.resize(n);
  iota(inds.begin(), inds.end(), 0);
  vector<int> merged(n), inv_merged(n);
  auto dnc = [&](auto&& self, int l, int r) -> bool {
    if ((r - l) == 1) return true;
    int mid = (l + r) / 2;
    if (!self(self, l, mid)) return false;
    if (!self(self, mid, r)) return false;
    int i1 = l, i2 = mid, p = l;
    while ((i1 < mid) && (i2 < r)) {
      int r1 = is_smaller(i1, i2);
      if (r1 < 0) return false;
      if (r1) {
        merged[p++] = i1++;
      }
      else {
        merged[p++] = i2++;
      }
    }
    while (i1 < mid) merged[p++] = i1++;
    while (i2 < r) merged[p++] = i2++;
    assert(p == r);
    for (int i = l; i < r; ++i) inv_merged[merged[i]] = i;
    for (int i = l; i < r; ++i) {
      if (int x = merged[i]; x != i) {
        make_swap(i, x);
        swap(merged[inv_merged[i]], merged[inv_merged[x]]);
        swap(inv_merged[i], inv_merged[x]);
      }
    }
    return true;
  };
  if (!dnc(dnc, 0, n)) return false;
  for (int i = 0; i < n; ++i) {
    if (inds[i] != i) {
      int j = 0;
      while (inds[j] != i) j++;
      if (make_query(inds[j], inds[i]) < 0) return false;
      swap(inds[j], inds[i]);
    }
  }
  cout << "-1 -1" << endl;
  return true;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  solve(n);
}