#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = (1LL << 62) - (1LL << 31) - 1;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define RREP(i, init, n) for(int i = (int)(init); i >= (int)(n); i--)
#define All(A) A.begin(), A.end()
#define rAll(A) A.rbegin(), A.rend()

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

int N;

void solve() {
    dsu U(N);
    vi p(N, -1);
    REP(i, 1, N + 1) {
        cout << 1 << " " << i << " " << i << endl;
        int k;
        cin >> k;
        if(k == -1) continue;
        int u = i - 1, v = k - 1;
        U.merge(u, v);
        p[v] = u;
    }

    vvi groups = U.groups();
    sort(All(groups), [](vi &a, vi &b){
        return a.size() > b.size();
    });

    vi beki2 = groups[0];
    int cur = beki2[0];
    while(p[cur] != -1) {
        cur = p[cur];
    }
    int one_idx = cur;
    vi ans(N, -1);
    ans[one_idx] = 1;
    int n = 2;
    while(n <= N) {
        cout << 1 << " " << one_idx + 1 << " " << cur + 1 << endl;
        int k;
        cin >> k;
        ans[k - 1] = n;
        n++;
        cur = k - 1;
    }
    cout << "2 ";
    REP(i, 0, N) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    cin >> N;
    solve();
}