#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "prison.h"
const int LG = 15;
std::vector<std::vector<int>> devise_strategy(int N) {
V<vi> mat;
int j = 0;
for (int i = LG; i >= 1; --i) {
if ((1 << i) > 2*N) continue;
mat.pb(vi(N+1));
mat.pb(vi(N+1));
mat.pb(vi(N+1));
mat[j][0] = 0;
mat[j+1][0] = mat[j+2][0] = 1;
int p = 1 << (i-1), l = 1;
while (l <= N) {
int r = l+p;
for (int k = l; k <= N && k < r; ++k) {
mat[j][k] = j+1;
mat[j+1][k] = j+3;
mat[j+2][k] = -2;
}
r += p;
for (int k = l+p; k <= N && k < r; ++k) {
mat[j][k] = j+2;
mat[j+2][k] = j+3;
mat[j+1][k] = -1;
}
l = r;
}
j += 3;
}
mat.pb(vi(N+1));
return mat;
}
