/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>

////多倍長整数, cpp_intで宣言
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

//#pragma gcc target ("avx2")
//#pragma gcc optimization ("Ofast")
//#pragma gcc optimization ("unroll-loops")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printLdb(a) printf("%.50Lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) //string出力
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
#define inf numeric_limits<double>::infinity();
#define linf numeric_limits<long double>::infinity()

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
	char c;
	str = "";
	scanf("%c", &c);
	if (c == '\n')scanf("%c", &c);
	while (c != '\n' && c != -1 && c != ' ') {
		str += c;
		scanf("%c", &c);
	}
}

void scanc(char& str) {
	char c;
	scanf("%c", &c);
	if (c == -1)return;
	while (c == '\n') {
		scanf("%c", &c);
	}
	str = c;
}


double acot(double x) {
	return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template<typename T>
T chmin(T& a, const T& b) {
	if (a > b)a = b;
	return a;
}

template<typename T>
T chmax(T& a, const T& b) {
	if (a < b)a = b;
	return a;
}

/*-----------------------------------------ここからコード-----------------------------------------*/

int moving(const int &myk, const int &myx, bitset<100>& b, int& t, int& k, int& x) {
	printf("%d %d\n", myk, myx);
	if (myk == 2)b[myx] = true;
	b[myx - 1] = true;
	fflush(stdout);
	scanf("%d", &t);
	if (t < 2)return -1;
	else {
		scanf("%d%d", &k, &x);
		if (k == 2)b[x] = true;
		b[--x] = true;
		if (t == 2)return 0;
		else return k + myk;
	}
}

int main() {

	int n;
	scanf("%d", &n);
	bitset<100> b;
	int cnt = n, t, k, x, ret;
	while (cnt > 4) {
		ret = 0;
		for (int i = 1; i < n - 1; ++i) {
			if (b[i - 1] == true and b[i] == false and b[i + 1] == true) {
				ret = moving(1, i + 1, b, t, k, x);
				if (ret < 1)return 0;
				else cnt -= ret;
				break;
			}
		}
		if (not ret) {
			rep(i, n - 1) {
				if (b[i] or b[i + 1] == false) {
					ret = moving(2, i + 1, b, t, k, x);
					if (ret < 1)return 0;
					else cnt -= ret;
					break;
				}
			}
		}
	}
	if (cnt == 4) {
		ret = 0;
		for (int i = 1; i < n - 1; ++i) {
			if (not(b[i - 1] == true and b[i] == false and b[i + 1] == true) and b[i] == false) {
				ret = moving(1, i + 1, b, t, k, x);
				if (ret < 1)return 0;
				else cnt -= ret;
				break;
			}
		}
		if (not ret) {
			rep(i, n) {
				if (b[i] == false) {
					ret = moving(1, i + 1, b, t, k, x);
					if (ret < 1)return 0;
					else cnt -= ret;
					break;
				}
			}
		}
	}
	if (cnt == 3) {
		ret = 0;
		for (int i = 1; i < n - 1; ++i) {
			if (b[i - 1] == false and b[i] == false and b[i + 1] == false) {
				ret = moving(1, i + 1, b, t, k, x);
				if (ret < 1)return 0;
				else cnt -= ret;
				break;
			}
		}
		if (not ret) {
			rep(i, n) {
				if (b[i] == false) {
					ret = moving(1, i + 1, b, t, k, x);
					if (ret < 1)return 0;
					else cnt -= ret;
					break;
				}
			}
		}
	}
	while (cnt) {
		rep(i, n) {
			if (b[i] == false) {
				ret = moving(1, i + 1, b, t, k, x);
				if (ret < 1)return 0;
				else cnt -= ret;
				break;
			}
		}
	}

	Please AC;
}