#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define all(a) a.begin(),a.end()
const int maxn = 2 * 1e6;
const int mod = 1e9 + 7;
bool que(int i,int j){
cout<<2 << ' ' << i<<' '<<j<<endl;
int an;
cin>>an;
return (an == 1 ? true : false);
}
signed main(){
int n;
cin>>n;
vector <int> a(n),b(n, -1);
for(int i = 0;i < n;i++)a[i] = i + 1;
int cnt = 1;
for(int i = 0;i < n;i++){
if(b[i] != -1)continue ;
b[i] = cnt;
for(int j = i + 1;j < n;j++){
if(b[j] != -1)continue ;
if(que(i + 1,j + 1)){
b[j] = cnt;
}
}
cnt++;
}
cout<<0<<' ';
for(int i : b)cout<<i<<' ';
return 0;
}
