#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N=330;
int n;
int mx;
int d[N],ans[N];

int bitc[N];
multiset <int> P[9];

map <int,int> mp;

int main(){
	for(int i=1;i<N;i++) bitc[i]=bitc[i>>1]+(i & 1);
	cin>>n;
	if(n==1){
		cout<<1<<" "<<1<<endl;
		int x; cin>>x;
		cout<<3<<" "<<x<<endl;
		return 0;
	}
	
	cout<<2<<" "<<n<<" ";
	for(int i=1;i<=n;i++) cout<<i<<" ";
	cout<<endl;
	for(int i=1;i<=n*(n-1)/2;i++){
		int x; cin>>x; mx=max(mx,x);
	}
	
	int l=2,r=n,pos=n;
	while(l<=r){
		int mid=(l+r)>>1;
		
		cout<<2<<" "<<mid<<" ";
		for(int i=1;i<=mid;i++) cout<<i<<" ";
		cout<<endl;
		int p=0;
		for(int i=1;i<=mid*(mid-1)/2;i++){
			int x; cin>>x; p=max(p,x);
		}
		if(p==mx) r=mid-1,pos=mid;
		else l=mid+1;
	}
	
	for(int t=0;t<8;t++){
		int ct=1;
		for(int mac=1;mac<=n;mac++){
			if((mac>>t & 1) && mac!=pos) ct++;
		}
		if(ct>1){
			cout<<2<<" "<<ct<<" ";
			for(int mac=1;mac<=n;mac++){
				if((mac>>t & 1) && mac!=pos) cout<<mac<<" ";
			}
			cout<<pos;
			cout<<endl;
			for(int i=1;i<=ct*(ct-1)/2;i++){
				int x; cin>>x;
				P[t].insert(x);
			}	
		}
		
		ct--;
		if(ct>1){
			cout<<2<<" "<<ct<<" ";
			for(int mac=1;mac<=n;mac++){
				if((mac>>t & 1) && mac!=pos) cout<<mac<<" ";
			}
			cout<<endl;
			for(int i=1;i<=ct*(ct-1)/2;i++){
				int x; cin>>x;
				P[t].erase(P[t].find(x));
			}	
		}
	}
	
	for(int t=8;t>=1;t--){
		for(int mac=1;mac<=n;mac++){
			if(bitc[mac]!=t || mac==pos) continue;
			mp.clear();
			for(int s=0;s<8;s++){
				if(!(mac>>s & 1)) continue;
				for(auto it=P[s].begin();it!=P[s].end();++it) mp[*it]++;
			}
			for(auto it=mp.begin();it!=mp.end();it++){
				if(it->second==t){
					d[mac]=it->first;
					break;
				}
			}
		}
		for(int mac=1;mac<=n;mac++){
			if(bitc[mac]!=t || mac==pos) continue;
			for(int s=0;s<8;s++){
				if(!(mac>>s & 1)) continue;
				P[s].erase(P[s].find(d[mac]));
			}
		}
	}
	
	cout<<1<<" "<<pos<<endl;
	cin>>ans[pos];
	
	int anotherpos=1;
	if(pos==anotherpos) pos=n;
	cout<<1<<" "<<anotherpos<<endl;
	int x; cin>>x;
	cout<<3<<" ";
	if(x<ans[pos]) for(int i=1;i<=n;i++) cout<<ans[pos]-d[i]<<" ";
	else for(int i=1;i<=n;i++) cout<<ans[pos]+d[i]<<" ";
	cout<<endl;
}