#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define ii pair<int, int>
#define vii vector<ii>
const int inf = INT_MAX;
int n;
vvi v;
std::vector<std::vector<int>> devise_strategy(int N) {
n = N;
v.resize(n+1, vi(n+1));
for (int i = 0; i <= n; i++) {
v[i][0] = i > 0;
for (int j = 1; j <= n; j++) {
if (!i) {
v[i][j] = j;
}
else {
if (i > j) v[i][j] = -2;
else v[i][j] = -1;
}
}
}
return v;
}
