#include "prison.h"
#include <bits/stdc++.h>
#define MAX 300001
#define INF LLONG_MAX
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define gett(x,m) get<m>(x)
#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define sorta(a,sz) sort(a,a+sz)
#define inputar(a,b){\
for(int i=0;i<b;i++){\
cin >> a[i];\
}\
}
#define inputvec(a,b){\
for(int i=0;i<b;i++){\
ll num;\
cin >> num;\
a.pb(num);\
}\
}
#define outputar(a,b){\
for(int i=0;i<b;i++){\
cout << a[i] << " ";\
}\
cout << "\n";\
}
#define outputvec(a){\
for(auto x:a){\
cout << x << " ";\
}\
cout << "\n";\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
freopen((filename+".in").c_str(),"r",stdin);
freopen((filename+".out").c_str(),"w",stdout);
}
vector<vector<int>> devise_strategy(int N) {
vector<vector<int>> v(27,vector<int>(N+1,0));
v[0][0]=0;
for(int i=1;i<=N;i++){
int d[14];
int num=i;
for(int z=13;z>=1;z--){
d[z]=num%2;
num/=2;
}
v[0][i]=d[1]*13+1;
}
for(int i=1;i<=26;i++){
int h,h2;
h=0;
if(i>=13){
h=1;
}
h2=i-h*13;
v[i][0]=h2%2;
for(int j=1;j<=N;j++){
int d[14];
int num=j;
for(int z=13;z>=1;z--){
d[z]=num%2;
num/=2;
}
if(h==d[h2]){
v[i][j]=h2+1+d[h2+1]*13;
}
else if(h>d[h2]){
v[i][j]=-h2%2-1;
}
else{
v[i][j]=h2%2-2;
}
}
}
return v;
}
