#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>

/* template start */

using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;

#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...)                                                    \
  std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
      debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0) std::cout << " :";
  debug_out(t...);
}

template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num>
constexpr Num mypow(Num a, u64 b, Num id = 1) {
  if (b == 0) return id;
  Num x = id;
  while (b > 0) {
    if (b & 1) x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

/* template end */

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  i64 n;
  std::cin>>n;

  std::vector<i64> grundy(n+1,0);

  rep(i,1,n+1){
    std::set<i64> set;
    rep(j,0,i)set.emplace(grundy[j]^grundy[i-1-j]);
    rep(j,0,i-1)set.emplace(grundy[j]^grundy[i-2-j]);

    rep(j,0,1000){
      if(set.find(j)==set.end()){
        grundy[i]=j;
        break;
      }
    }
  }

  using P=std::pair<i64,i64>;

  std::list<P> seg;

  seg.emplace_back(0,n);
  i64 num=grundy[n];

  while(true){
    i64 max=-1;
    std::list<P>::iterator maxitr;
    for(auto itr=seg.begin();itr!=seg.end();itr++){
      if(chmax(max,grundy[itr->second-itr->first])){
        maxitr=itr;
      }
    }

    P tmp_seg=*maxitr;
    seg.erase(maxitr);

    i64 len=tmp_seg.second-tmp_seg.first;

    num^=grundy[len];

    P erase_seg;

    rep(i,0,len){
      if((grundy[i]^grundy[len-1-i]) == num){
        erase_seg={tmp_seg.first+i,tmp_seg.first+i+1};
      }
    }
    rep(i,0,len-1){
      if((grundy[i]^grundy[len-2-i])==num){
        erase_seg={tmp_seg.first+i,tmp_seg.first+i+2};
      }
    }

    num=0;
    if(tmp_seg.first!=erase_seg.first)seg.emplace_back(tmp_seg.first,erase_seg.first);
    if(tmp_seg.second!=erase_seg.second)seg.emplace_back(erase_seg.second,tmp_seg.second);

    std::cout<<erase_seg.second-erase_seg.first<<" "<<erase_seg.first+1<<std::endl;

    i64 t;
    std::cin>>t;

    if(t==0)break;
    if(t==1)break;

    i64 k,x;
    std::cin>>k>>x;

    if(t==2)break;

    for(auto itr=seg.begin();itr!=seg.end();itr++){
      if(itr->first <= x-1&&x-1+k<=itr->second){
        debug(*itr);
        P tmptmp=*itr;
        seg.erase(itr);
        if(tmptmp.first!=x-1)seg.emplace_back(tmptmp.first,x-1);
        if(tmptmp.second!=x-1+k)seg.emplace_back(x-1+k,tmptmp.second);
        break;
      }
    }

    for(auto e:seg){
      debug(e);
      num^=grundy[e.second-e.first];
    }
  }

  return 0;
}