#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

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