#include<bits/stdc++.h>

#define rep(i,l,r) for(auto i(l),i##_end(r);i<=i##_end;++i)
#define per(i,r,l) for(auto i(r),i##_end(l);i>=i##_end;--i)
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) ((int)(a).size())

using namespace std;
using cint=const int;
using ll=long long;
using cll=const long long;
using ull=unsigned long long;
#if __SIZEOF_POINTER__==8
using lll=__int128;
#endif
using db=double;
using ld=long double;
using pii=pair<int,int>;
using vi=vector<int>;
using vii=vector<pii>;
mt19937 rnd(random_device{}());
mt19937_64 rnd64(random_device{}());

void debug()
{
	cerr<<"\n";
}
template<typename T,typename ...Args>
void debug(T t,Args ...args)
{
	cerr<<t;
	if(sizeof...(args)) cerr<<", ";
	debug(args...);
}
#define deb(x...) do{ cerr<<#x<<": "; debug(x); }while(0)

template<typename T>
bool cmax(T &a,const T &b){ return b>a?a=b,1:0; }
template<typename T>
bool cmin(T &a,const T &b){ return b<a?a=b,1:0; }

// #define LOCAL
int ans[1145];

int query1(int i)
{
	cout<<"1 "<<i<<"\n";
	#ifdef LOCAL
		return ans[i];
	#endif
	int res;
	cin>>res;
	return res;
}
vi query2(const vi &a)
{
	if(SZ(a)<=1) return {}; 
	cout<<"2 "<<SZ(a)<<" "; 
	for(int i:a) cout<<i<<" ";
	cout<<endl;
	#ifdef LOCAL
		vi shit;
		rep(i,0,SZ(a)-1) 
			rep(j,i+1,SZ(a)-1) shit.pb(abs(ans[a[i]]-ans[a[j]]));
		shuffle(all(shit),rnd);
		sort(all(shit));
		return shit;
	#endif
	vi res(SZ(a)*(SZ(a)-1)/2);
	rep(i,0,SZ(res)-1) cin>>res[i];
	sort(all(res));
	return res;
}
const int N=255;
vi isc(const vi &a,const vi &b)
{
	vi res;
	int j=0;
	rep(i,0,SZ(a)-1)
	{
		while(j<SZ(b)&&b[j]<a[i]) j++;
		if(j<SZ(b)&&b[j]==a[i]) res.pb(a[i]),j++;
	}
	return res;
}
vi pc(const vi &a,const vi &b)
{
	vi res;
	int j=0;
	rep(i,0,SZ(a)-1)
	{
		while(j<SZ(b)&&b[j]<a[i]) j++;
		if(j<SZ(b)&&b[j]==a[i]) j++;
		else res.pb(a[i]);
	}
	return res;
}
vi fuck(vi a,int p)
{
	vi B=query2(a);
	a.pb(p);
	vi A=query2(a);
	return pc(A,B);
}
int n,pos,d[N],v[N];
vi pussy,cunt[10][2];
int main()
{
	ios::sync_with_stdio(0);
	cin>>n;
	#ifdef LOCAL
		rep(i,1,n) cin>>ans[i];
	#endif
	if(n==1)
	{
		int MLG=query1(1);
		cout<<"3 "<<MLG;
		return 0;
	}
	vi a;
	rep(i,1,n) a.pb(i);
	int mg=query2(a).back();
	// cerr<<mg<<"\n";
	int l=1,r=n-1;
	while(l<r)
	{
		int mid=l+r>>1;
		vi a;
		rep(i,mid+1,n) a.pb(i);
		// deb(mid);
		// deb(SZ(a));
		// for(int i:a) cerr<<i<<" ";
		// cerr<<"\n";
		// deb(SZ(a));
		if(query2(a).back()==mg) l=mid+1;
		else r=mid;
	}
	pos=l;
	v[pos]=query1(pos);
	// cerr<<"pos="<<pos<<"val="<<v[pos]<<"\n";
	vi id;
	rep(i,1,n) if(i!=pos) id.pb(i);
	pussy=fuck(id,pos);
	// cerr<<"pussy\n";
	// for(int i:pussy) cerr<<i<<" ";
	// cerr<<"\n";
	rep(k,0,7)
	{
		vi a;
		rep(i,0,SZ(id)-1)
			if(i>>k&1) a.pb(id[i]);
		
		cunt[k][1]=fuck(a,pos);
		cunt[k][0]=pc(pussy,cunt[k][1]);

	}
	rep(i,0,SZ(id)-1)
	{
		vi ass=pussy;
		rep(k,0,7) ass=isc(ass,cunt[k][i>>k&1]); 
		d[id[i]]=ass.back();
	}
	bool fl=0;
	rep(i,1,n) 
		if(d[i]==mg)
		{
			v[i]=query1(i);
			if(v[i]<v[pos]) fl=1;
		}
	rep(i,1,n) v[i]=v[pos]+(fl?-d[i]:d[i]);
	cout<<"3 ";
	rep(i,1,n) cout<<v[i]<<" ";
}