#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

pair<int,int> solve(int N, const vector<int>& v, int k, int x){
  if(N == 1) return make_pair(1,1);
  if(N == 2) return make_pair(2,1);

  if(k == 0){
    if(N%2==0) return make_pair(2,N/2);
    else return make_pair(1,(N+1)/2);
  }

  if(N%2==0){
    if(k==1) return make_pair(k,N-x+1);
    else return make_pair(k,N-x+1-1);
  }else{
    if(k==1) return make_pair(k,N-x+1);
    else return make_pair(k,N-x+1-1);    
  }
}


int main(){
  int N;
  cin >> N;

  vector<int> v(N+1, 0);
  int k = 0, x = 0;
  int cnt = N;
  while(true){
    pair<int,int> res = solve(N, v, k, x);
    cout << res.first << " " << res.second << endl;
    rep(i,res.first){
      v[res.second+i] = 1;
    }


    int t;
    cin >> t;
    if(t == 0) break;
    if(t == 1) break;
    cin >> k >> x;
    if(t == 2) break;
    rep(i,k){
      v[x+i] = 1;
    }
  }
  
  return 0;
}