#include "prison.h"
#include<bits/stdc++.h>
using namespace std;
#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define s second
#define f first
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 1e6;
vector<vector<int>> devise_strategy(int n) {
int pw[8];
pw[0] = 1;
for (int i = 1; i < 8; i++) pw[i] = pw[i - 1] * 3;
vector<int> f(31), g(40);
int j = 0;
for (int i = 0; i <= 23; i++, j++) {
if (j == 1 || j == 3) j++;
f[i] = j;
g[j] = i;
}
vector<vector<int>> ans;
for (int z = 0; z <= 23; z++) {
int x = f[z];
if (!x) {
vector<int> s = {0};
for (int i = 1; i <= n; i++) {
int v = (i / pw[7]) % 3;
s.push_back(g[7 * 3 + v + 1]);
}
ans.push_back(s);
continue;
}
int v = x - 1;
if ((v / 3) & 1) {
vector<int> s = {1};
int b = v / 3, is = v % 3;
for (int i = 1; i <= n; i++) {
int y = (i / pw[b]) % 3;
if (is < y) s.push_back(-1);
else if (is > y) s.push_back(-2);
else {
y = (i / pw[b - 1]) % 3;
if (b == 1 && y == 0) s.push_back(-2);
else if (b == 1 && y == 2) s.push_back(-1);
else s.push_back(g[(b - 1) * 3 + y + 1]);
}
}
ans.push_back(s);
}else {
vector<int> s = {0};
int b = v / 3, is = v % 3;
for (int i = 1; i <= n; i++) {
int y = (i / pw[b]) % 3;
if (is < y) s.push_back(-2);
else if (is > y) s.push_back(-1);
else {
if (b == 0) s.push_back(-1);
else {
y = (i / pw[b - 1]) % 3;
s.push_back(g[(b - 1) * 3 + y + 1]);
}
}
}
ans.push_back(s);
}
}
return ans;
}
