#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <time.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 5020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

P ask(int k, int x){
	cout << k << " " << x << endl;
	int t; cin >> t;
	if(t == 0 || t == 1) return {-1,-1};
	P p; cin >> p.first >> p.second;
	if(t == 2) exit(0);
	return p;
}


int main(){
	int n; cin >> n;
	vb v(n,false);
	while(1){
		rep(i,n){
			if(v[i]) continue;
			ll exor = 0;
			v[i] = true;
			rep(j,n){
				if(!v[j]){
					int k = j;
					while(k < n && !v[k]) k++;
					exor ^= k-j;
					j = k-1;
				}
			}
			if(exor == 0){
				P p = ask(1,i+1);
				if(p.first == -1) return 0;
				if(p.first == 1) v[p.second-1] = true;
				else for(int j=p.second-1; j<=p.second; j++) v[j] = true;
				break;
			}
			v[i] = false;
			if(i == n-1 || v[i+1]) continue;
			v[i] = true;
			v[i+1] = true;
			exor = 0;
			rep(j,n){
				if(!v[j]){
					int k = j;
					while(k < n && !v[k]) k++;
					exor ^= k-j;
					j = k-1;
				}
			}
			if(exor == 0){
				P p = ask(2,i+1);
				if(p.first == -1) return 0;
				if(p.first == 1) v[p.second-1] = true;
				else for(int j=p.second-1; j<=p.second; j++) v[j] = true;
				break;
			}
			v[i] = false;
			v[i+1] = false;
		}
	}
}