#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
void solve() {
  int n;
  cin >> n;
  int curr = 2;
  long long tmp;
  for (int i = 3; i < n + 1; i++) {
    cout << "2 1 " << curr << " " << i << "\n";
    fflush(stdout);
    cin >> tmp;
    if (tmp == -1) {
      curr = i;
    }
  }
  vector<pair<long long, long long> > pnts(n, make_pair(-1, -1));
  for (long long i = 0; i < n; i++) {
    pnts[i].second = i;
    if (i + 1 != 1 && i + 1 != curr) {
      cout << "1 1 " << curr << " " << i + 1 << "\n";
      fflush(stdout);
      cin >> tmp;
      pnts[i].first = tmp;
    }
  }
  sort((pnts).begin(), (pnts).end());
  deque<int> out;
  out.push_back(1);
  out.push_back(curr);
  for (int i = 2; i < n - 1; i++) {
    cout << "2 1 " << pnts[i].second + 1 << " " << pnts[i + 1].second + 1
         << "\n";
    fflush(stdout);
    cin >> tmp;
    if (tmp == 1) {
      out.push_back(pnts[i].second + 1);
    } else {
      out.push_front(pnts[i].second + 1);
    }
  }
  cout << 0 << " ";
  out.push_back(pnts[n - 1].second + 1);
  while (out.front() != 1) {
    tmp = out.front();
    out.pop_front();
    out.push_back(tmp);
  }
  for (long long i = 0; i < n; i++) {
    cout << out.front() << " ";
    out.pop_front();
  }
  fflush(stdout);
}
int main() {
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
