#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=151,INF=1000000000;
using namespace std;
vector<ll>parent(sz,-1);
ll get(ll num)
{
if(parent[num]<0)
{
return num;
}
else
{
parent[num]=get(parent[num]);
return get(parent[num]);
}
}
void unite(ll num1,ll num2)
{
ll res1=get(num1),res2=get(num2);
if(res1!=res2)
{
if(parent[res1]>parent[res2])
{
swap(res1,res2);
}
parent[res1]+=parent[res2],parent[res2]=res1;
}
}
vector<ll>f(vector<ll>nums)
{
vector<ll>Nums,res;
set<ll>numS;
for(int i=0;i<nums.size();i++)
{
numS.in(nums[i]);
}
for(auto num:numS)
{
Nums.pb(num);
}
for(int i=0;i<nums.size();i++)
{
res.pb(lower_bound(all(Nums),nums[i])-Nums.begin()+1);
}
return res;
}
void solve()
{
ll n,num;
cin>>n;
vector<ll>ans;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
cout<<"2 "<<i<<" "<<j<<"\n";
cout.flush();
cin>>num;
if(num==1)
{
unite(i,j);
}
}
}
for(int i=0;i<n;i++)
{
ans.pb(get(i+1));
}
ans=f(ans);
cout<<"0 ";
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" ";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
