#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef vector<int> vi;
// END NO SAD
typedef long long ll;
typedef pair<int, int> pii;
int ret[155];
int n;
void solve() {
cin >> n;
cout << n;
for(int i = 1; i <= n; i++) {
cout << " " << i;
} cout << endl;
int k;
cin >> k;
memset(ret, 1, sizeof(ret));
int next = 1;
for(int src = 1; src <= n; src++) {
if(ret[src] <= k) continue;
assert(next <= k);
ret[src] = next;
for(int dst = src+1; dst <= n; dst++) {
if(ret[dst] <= k) continue;
if(next == k) {
ret[dst] = k;
continue;
}
cout << 2 << " " << src << " " << dst << endl;
int t;
cin >> t;
if(t == 1) ret[dst] = next;
}
next++;
}
cout << 0;
for(int i = 1; i <= n; i++) cout << " " << ret[i];
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
}
