Problem: This is an interactive problem.

Khanh has n points on the Cartesian plane, denoted by a_1, a_2, …, a_n. All points' coordinates are integers between -10^9 and 10^9, inclusive. No three points are collinear. He says that these points are vertices of a convex polygon; in other words, there exists a permutation p_1, p_2, …, p_n of integers from 1 to n such that the polygon a_{p_1} a_{p_2} … a_{p_n} is convex and vertices are listed in counter-clockwise order.

Khanh gives you the number n, but hides the coordinates of his points. Your task is to guess the above permutation by asking multiple queries. In each query, you give Khanh 4 integers t, i, j, k; where either t = 1 or t = 2; and i, j, k are three distinct indices from 1 to n, inclusive. In response, Khanh tells you:

  * if t = 1, the area of the triangle a_ia_ja_k multiplied by 2. 
  * if t = 2, the sign of the cross product of two vectors \overrightarrow{a_ia_j} and \overrightarrow{a_ia_k}. 



Recall that the cross product of vector \overrightarrow{a} = (x_a, y_a) and vector \overrightarrow{b} = (x_b, y_b) is the integer x_a ⋅ y_b - x_b ⋅ y_a. The sign of a number is 1 it it is positive, and -1 otherwise. It can be proven that the cross product obtained in the above queries can not be 0.

You can ask at most 3 ⋅ n queries.

Please note that Khanh fixes the coordinates of his points and does not change it while answering your queries. You do not need to guess the coordinates. In your permutation a_{p_1}a_{p_2}… a_{p_n}, p_1 should be equal to 1 and the indices of vertices should be listed in counter-clockwise order.

Interaction

You start the interaction by reading n (3 ≤ n ≤ 1 000) — the number of vertices.

To ask a query, write 4 integers t, i, j, k (1 ≤ t ≤ 2, 1 ≤ i, j, k ≤ n) in a separate line. i, j and k should be distinct.

Then read a single integer to get the answer to this query, as explained above. It can be proven that the answer of a query is always an integer.

When you find the permutation, write a number 0. Then write n integers p_1, p_2, …, p_n in the same line.

After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



Hack format

To hack, use the following format:

The first line contains an integer n (3 ≤ n ≤ 1 000) — the number of vertices.

The i-th of the next n lines contains two integers x_i and y_i (-10^9 ≤ x_i, y_i ≤ 10^9) — the coordinate of the point a_i.

Example

Input


6

15

-1

1

Output


1 1 4 6

2 1 5 6

2 2 1 4

0 1 3 4 2 6 5

Note

The image below shows the hidden polygon in the example:

<image>

The interaction in the example goes as below: 

  * Contestant reads n = 6. 
  * Contestant asks a query with t = 1, i = 1, j = 4, k = 6. 
  * Jury answers 15. The area of the triangle A_1A_4A_6 is 7.5. Note that the answer is two times the area of the triangle. 
  * Contestant asks a query with t = 2, i = 1, j = 5, k = 6. 
  * Jury answers -1. The cross product of \overrightarrow{A_1A_5} = (2, 2) and \overrightarrow{A_1A_6} = (4, 1) is -2. The sign of -2 is -1. 
  * Contestant asks a query with t = 2, i = 2, j = 1, k = 4. 
  * Jury answers 1. The cross product of \overrightarrow{A_2A_1} = (-5, 2) and \overrightarrow{A_2A_4} = (-2, -1) is 1. The sign of 1 is 1. 
  * Contestant says that the permutation is (1, 3, 4, 2, 6, 5). 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
struct Node {
  int id;
  long long dis;
} node[maxn];
bool cmp(const Node &lhs, const Node &rhs) { return lhs.dis < rhs.dis; }
vector<Node> region_big[2], region_small[4];
Node big_brother[2];
long long rd() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int main() {
  long long n;
  scanf("%lld", &n);
  for (int i = 3; i <= n; i++) {
    printf("%d %d %d %d\n", 1, 1, 2, i);
    fflush(stdout);
    scanf("%lld", &node[i].dis);
    node[i].id = i;
  }
  for (int i = 3; i <= n; i++) {
    printf("%d %d %d %d\n", 2, 1, 2, i);
    fflush(stdout);
    region_big[rd() == 1 ? 1 : 0].push_back(node[i]);
  }
  sort(region_big[0].begin(), region_big[0].end(), cmp);
  sort(region_big[1].begin(), region_big[1].end(), cmp);
  for (int j = 0; j < 2; j++) {
    if (region_big[j].empty()) continue;
    big_brother[j] = region_big[j][region_big[j].size() - 1];
    for (int i = 0; i < region_big[j].size() - 1; i++) {
      printf("%d %d %d %d\n", 2, 1, big_brother[j].id, region_big[j][i].id);
      fflush(stdout);
      region_small[2 * j + (rd() == 1 ? 1 : 0)].push_back(region_big[j][i]);
    }
  }
  printf("0");
  for (int j = 0; j < 4; j++) {
    int border = -1;
    if (j == 0) border = 1;
    if (j == 2) border = 2;
    if (j == 1 && !region_big[0].empty()) border = big_brother[0].id;
    if (j == 3 && !region_big[1].empty()) border = big_brother[1].id;
    if (border != -1) printf(" %d", border);
    int start = (j % 2 ? region_small[j].size() - 1 : 0);
    int target = (j % 2 ? -1 : region_small[j].size());
    int step = (j % 2 ? -1 : 1);
    for (int i = start; i != target; i += step)
      printf(" %d", region_small[j][i].id);
  }
  return 0;
}