/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

void solve(){
    ll N;
    cin >> N;
    ll state[110] = {};
    state[N] = 1;
    while(true){
        ll k,x;
        ll num = 0;
        ll cnt = 0;
        rep(i,0,N+1){
            if(state[i] == 0){
                num++;
            }else{
                if(num > 0){
                    cnt++;
                }
                num = 0;
            }
        }
        if(cnt % 2 == 0){
            rep(i,0,N){
                if(state[i] == 0){
                    k = 1;
                    x = i;
                    state[x] = 1;
                    break;
                }
            }
        }else{
            ll num = 0;
            rep(i,0,N+1){
                if(state[i] == 0){
                    num++;
                }else{
                    if(num > 0){
                        if(num == 1){
                            k = 1;
                            x = i-1;
                            state[x] = 1;
                        }else if(num == 2){
                            k = 2;
                            x = i-2;
                            state[x] = 1;
                            state[x+1] = 1;
                        }else{
                            k = 1;
                            x = i-2;
                            state[x] = 1;
                        }
                        break;
                    }
                    num = 0;
                }
            }
        }
        cout << k << " " << x+1 << endl;
        ll t;
        cin >> t;
        if(t == 0 || t == 2){
            return;
        }else if(t == 1){
            exit(1);
        }else{
            ll k,x;
            cin >> k >> x;
            if(k == 1){
                state[x-1] = 1;
            }else{
                state[x-1] = 1;
                state[x] = 1;
            }

        }
        
    }
    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}