#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

vector<ll> g(5010, -1);
ll in[5010], n;

ll dfs(ll x, ll c){
  if(g[x] == -1) return c;
  return dfs(g[x], c + 1);
}

int main(){
  cin >> n;
  vector<ll> ans(n);
  REP(i, n){
    cout << 1 <<" " << i + 1 <<" " << i + 1 << endl;
    ll res;
    cin >> res;
    if(res != -1){
      res--;
      in[res]++;
      g[i] = res;
    }
  }
  ll best = 0, one = 0;
  REP(i, n){
    if(in[i] == 0){
      ll res = dfs(i, 0);
      if(best < res){
        best = res;
        one = i;
      }
    }
  }
  ll now = one;
  ans[now] = 1;
  FOR(i, 2, n + 1){
    cout << 1 << " " << one + 1 <<" " << now + 1 << endl;
    ll res;
    cin >> res;
    res--;
    now = res;
    ans[now] = i;
  }
  cout << 2;
  REP(i, n){
    cout << " " << ans[i];
  }
  cout << endl;
}