#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


signed main() {
    fio();

    int n;
    cin >> n;

    vector<int> gl(n + 1);
    gl[0] = 0;
    for (int i = 1; i <= n; i++) {
        set<int> st;
        for (int j = 0; j < i; j++) {
            int x1 = gl[j], x2 = gl[i - 1 - j];
            st.insert(x1 ^ x2);
        }
        for (int j = 0; j < i - 1; j++) {
            int x1 = gl[j], x2 = gl[i - 2 - j];
            st.insert(x1 ^ x2);
        }

        rep (j, 1000) {
            if (st.count(j) == 0) {
                gl[i] = j;
                break;
            }
        }
    }
    DEBUG_VEC(gl);

    vector<pii> now(1, pii(1, n));
    while (true) {
        int x = 0;
        rep (i, now.size()) {
            x ^= gl[now[i].second];
        }

        rep (i, now.size()) {
            int idx = now[i].first;
            int x2 = x ^ gl[now[i].second];
            bool flag = false;
            for (int j = 0; j < now[i].second; j++) {
                int y1 = gl[j], y2 = gl[now[i].second - 1 - j];
                if ((x2 ^ y1 ^ y2) == 0) {
                    flag = true;
                    cout << 1 << " " << idx + j << endl;
                    if (j != 0) now.push_back(pii(idx, j));
                    if (now[i].second - 1 - j != 0) now.push_back(pii(idx + j + 1, now[i].second - 1 - j));
                    now.erase(now.begin() + i);
                    break;
                }
            }
            if (flag) break;
            for (int j = 0; j < now[i].second - 1; j++) {
                int y1 = gl[j], y2 = gl[now[i].second - 2 - j];
                if ((x2 ^ y1 ^ y2) == 0) {
                    flag = true;
                    cout << 2 << " " << now[i].first + j << endl;
                    if (j != 0) now.push_back(pii(idx, j));
                    if (now[i].second - 2 - j != 0) now.push_back(pii(idx + j + 2, now[i].second - 2 - j));
                    now.erase(now.begin() + i);
                    break;
                }
            }
            if (flag) break;
        }        
        // DEBUG_VEC(now);

        int t;
        cin >> t;
        if (t == 0) return 0;
        if (t == 1) assert(false);
        if (t == 2 or t == 3) {
            int k, x;
            cin >> k >> x;
            rep (i, now.size()) {
                int idx = now[i].first;
                if (in(x, now[i].first, now[i].first + now[i].second)) {
                    DEBUG(i);
                    int j = x - now[i].first;
                    DEBUG(j);
                    if (j != 0) now.push_back(pii(idx, j));
                    if (now[i].second - k - j != 0) now.push_back(pii(idx + j + k, now[i].second - k - j));
                    now.erase(now.begin() + i);
                    break;
                }
            }
            if (t == 2) return 0;
        }
        // DEBUG_VEC(now);
    }
}