#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define rep1(i, n) for(ll i = 1; i <= (ll)(n); ++i)
#define rrep(i, n) for(ll i = (ll)(n) - 1; i >= 0; --i)
#define rrep1(i, n) for(ll i = (ll)(n); i >= 1; --i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#ifdef DEBUG
#define dbg if(true)
#else
#define dbg if(false)
#endif
template<typename T> bool chmin(T &a, const T &b) {if(a>b) {a=b; return true;} return false;}
template<typename T> bool chmax(T &a, const T &b) {if(a<b) {a=b; return true;} return false;}
template <typename T> void print(const T &a) {cout << a << '\n';}
template <typename T> void print(const vector<T> &v1) {for(int i=0; i<v1.size(); ++i){if(i) {cout << ' ';} cout << v1[i];} cout << '\n';}
template <typename T> void print(const vector<vector<T>> &v2) {for(int i=0; i<v2.size(); ++i) print(v2[i]); cout << '\n';}



void solve() {
  int n; cin >> n;
  if(n % 2 == 1) {
    cout << 1 << " " << n / 2 + 1 << endl;
  } else {
    cout << 2 << " " << n / 2 << endl;
  }
  while(true) {
    int t; cin >> t;
    if(t != 3) return;
    int k, x; cin >> k >> x;
    if(x > n / 2 + 1) cout << k << " " << x - (n + 2) / 2 << endl;
    else cout <<  k << " " << x + (n + 2) / 2 << endl;
  }
  return;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int test_case = 1;
  // cin >> test_case;
  // cout << std::setprecision(15);
  while (test_case--) {
    solve();
  }
  return 0;
}