#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
const int N = 1005;
 
int p[N], sz[N];
set<pair<int, int> > S;
 
int par(int x) {
	if(p[x] != x)	p[x] = par(p[x]);
	return p[x];
}
 
int main() {
 
	int n, u, v, w;
	ll ans = 0;
 
	cin>>n;
 
	for(int i = 1; i <= n; i++) {
		sz[i] = 1;
		p[i] = i;
		S.insert(make_pair(sz[i], i));
	}
 
	while((int)S.size() > 1) {
 
		pair<int, int> tmp = *S.begin();
 
		cout<<1<<" "<<tmp.first<<" "<<n - tmp.first<<'\n';
		fflush(stdout);
 
		vector<int> a, b;
		for(int i = 1; i <= n; i++) {
			if(par(i) == tmp.second)	a.push_back(i);
			else						b.push_back(i);
		}
		for(auto u : a)	cout<<u<<" ";
		fflush(stdout);
		cout<<'\n';
		fflush(stdout);
		for(auto v : b)	cout<<v<<" ";
		fflush(stdout);
		cout<<'\n';
		fflush(stdout);
		
		cin>>u>>v>>w;
		if(u == -1)	continue; //should not be triggered anywhere
		int p1 = tmp.second, p2 = par(v);
		//cout<<"K"<<endl;
		ans += w;
		S.erase(S.find(tmp));
		//cout<<"KK"<<endl;
		//cout<<p2<<" "<<sz[p2]<<endl;
		S.erase(S.find(make_pair(sz[p2], p2)));
 
		//cout<<"WOW"<<endl;
 
		if(sz[p2] > sz[p1])	swap(p1, p2);
		p[p2] = p1;
		sz[p1] += sz[p2];
		S.insert(make_pair(sz[p1], p1));
	}
	cout<<2<<" "<<ans<<'\n';
	fflush(stdout);
}