#include "prison.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
std::vector<std::vector<int>> devise_strategy(int n) {
vector<vector<int>> a(2 * 13 + 1, vector<int>(n + 1));
ll bag = 0;
for (int i = 1; i <= n; i++) {
ll bbit = ((i & (1 << 12)) ? 1 : 0);
a[0][i] = 1 + bbit;
}
for (int i = 1; i <= 2 * 13; i++) {
ll c = (i + 1) / 2;
ll num = (i - 1) % 2;
ll bit = 13 - c;
a[i][0] = (c % 2 == 0) ? 0 : 1;
for (int j = 1; j <= n; j++) {
ll bbit = ((j & (1 << bit)) ? 1 : 0);
if (num < bbit) {
if (c % 2 == 1) {
a[i][j] = -1;
} else {
a[i][j] = -2;
}
} else if (num > bbit) {
if (c % 2 == 1) {
a[i][j] = -2;
} else {
a[i][j] = -1;
}
} else {
if(bit == 0){
a[i][j] = -1;
}
else{
ll nbit = ((j & (1 << (bit - 1))) ? 1 : 0);
a[i][j] = i + 2 - num + nbit;
}
}
}
}
return a;
}
