#include <bits/stdc++.h>
//#include "prison.h"
using namespace std;
using ll = long long;
vector<vector<int>> devise_strategy(int n) {
vector<vector<int>> ans(40, vector<int>(n + 1));
ans[0][0] = 1;
for (int i = 1;i <= n;i++) {
ans[0][i] = 39;
}
for (int i = 1;i <= 13;i++) {
int a = i;
ans[i][0] = 2;
for (int j = 1;j <= n;j++) {
if (!(j & (1 << (a - 1)))) ans[i][j] = -2;
else ans[i][j] = 26 + a - 1;
}
}
for (int i = 14;i <= 26;i++) {
int a = i - 13;
ans[i][0] = 2;
for (int j = 1;j <= n;j++) {
if (j & (1 << (a - 1))) ans[i][j] = -1;
else ans[i][j] = 26 + a - 1;
}
}
for (int i = 27;i <= 39;i++) {
int a = i - 26;
ans[i][0] = 1;
for (int j = 1;j <= n;j++) {
if (j & (1 << (a - 1))) ans[i][j] = a;
else ans[i][j] = 13 + a;
}
}
return ans;
}
