#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int n;
  cin >> n;
  vector<bool> chk(n, false);
  if(n % 2 == 0){
    cout << 2 << " " << n/2 << endl;
  }else{
    cout << 1 << " " << n/2+1 << endl;
  }
  int d = n/2+1;
  while(1){
    int t;
    cin >> t;
    if(t == 0) break;
    if(t == 1) return 1;
    int k, x;
    cin >> k >> x;
    if(t == 2) break;
    int nx;
    if(d < x) nx = x - d;
    else nx = x + d;
    cout << k << " " << nx << endl;
  }
  return 0;
}