#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
bool ok(int x,int y){
	printf("1 %d %d\n",x,y);
	fflush(stdout);
	int res;
	scanf("%d",&res);
	return res;
}
int main(){
    int n;
    scanf("%d",&n);
    vector<int>ans;
    for(int i=1;i<=n;i++){
		ans.pb(i);
		int res=i,pw=-1;
		for(int j=0;res+(1<<j)<=n and ok(i,res+(1<<j));j++){
			res+=(1<<j);
			pw=j;
		}
		if(~pw){
			for(int j=pw;j>=0;j--)
				if(res+(1<<j)<=n){
					if(ok(i,res+(1<<j)))
						res+=(1<<j);
				}
		}
		i=res;	
	}
	printf("2 %d ",int(ans.size()));
	tr(it,ans)
		printf("%d ",*it);
	puts("");	
	return 0;
}