#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
//#define int ll
const int N = 200;
const int INF = 1e9;
int n, a[N];
int main () {
cin >> n;
int col = 0;
fo(i, 1, n, 1) {
if(a[i] != 0) continue;
a[i] = ++col;
fo(j, i + 1, n, 1) {
cout << 2 <<' '<< i <<' '<< j <<endl;
int cnt;
cin >> cnt;
if(cnt == 1) {
a[j] = col;
}
}
}
cout << 0 <<" ";
fo(i, 1, n, 1)
cout << a[i] <<" ";
cout << endl;
return 0;
}
/*
If you only do what you can do,
You will never be more than you are now!
----------------------------------------
We must all suffer from one of two pains: the pain of discipline or the pain of regret.
The difference is discipline weighs grams while regret weighs tons.
*/
