#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <list>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define LL long long
#define ULL unsigned long long
#define PI (atan(1) * 4)
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

bool AreEqual(double a, double b) {
	return (fabs(a - b) < 1e-10);
}

template <class T>
bool GetNr(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		if (ch == -1) {
			return false;
		}
		ch == '-' ? _sign = -1 : _sign = 1 ;
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
	return true;
}

template <class T>
void PutNr(T _value, char _ch = ' ') {
	cout << _value << _ch;
}

int N, GM;
vector <int> ans;

bool Ask(int x, int y) {
	cout << 1 << ' ' << x << ' ' << y << '\n';
	cout.flush();
	cin >> x;
	return x;
}

int main(){
	string fileInput = "sum";
#ifdef INFOARENA
	freopen((fileInput + ".in").c_str(), "r", stdin);
	freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
//	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
		//	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/result", "w", stdout);
#endif
#endif
	
	int i, st, en, pw;
	bool segment;
	
	cin >> N;
	GM = 8 * N;
	st = 1, en = N;
	segment = false;
	if (N == 1) {
		cout << 2 << ' ' << 1 << ' ' << 1;
		cout.flush();
		return 0;
	}
	while (st < en) {
		for (pw = 1 << 6; pw > 1; pw >>= 1) {
			if (st + pw - 1 <= N) {
				if (Ask(st, st + pw - 1)) {
					if (segment == false) {
						segment = true;
						ans.pb(st);
						st += pw;
						break;
					}
					st += pw;
				}
				else {
					if (pw == 2 && segment == true) {
						++st;
						segment = false;
					}
					else if (pw == 2 && segment == false) {
						ans.pb(st);
						st++;
					}
				}
			}
		}
	}
	if (st == en) {
		if (!Ask(N - 1, N))
			ans.pb(st);
	}
	cout << 2 << ' ';
	cout << ans.size() << ' ';
	for (i = 0; i < ans.size(); ++i) {
		cout << ans[i] << ' ';
	}
	cout << '\n';
	cout.flush();
	
	
	return 0;
}