#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  if (n % 2 == 0) {
    cout << 2 << ' ' << n / 2 << endl;
  } else {
    cout << 1 << ' ' << (n + 1) / 2 << endl;
  }
  function<int(int)> f = [&](int x) {
    return n + 1 - x;
  };
  while (true) {
    int t; cin >> t;
    assert(t != 1 && t != 2);
    if (t == 0) return 0;
    if (t == 3) {
      int k, x; cin >> k >> x;
      cout << k << ' ' << (k == 1 ? f(x) : min(f(x), f(x + 1))) << endl;
    }
  }
}