#include<iostream>
#include<algorithm>
#include<vector>
#include "prison.h"
using namespace std;
std::vector<std::vector<int>> devise_strategy(int N)
{
int n=N;
vector<vector<int>>s;
s.resize(27);
for(int i=0;i<=26;i++)s[i].resize(n+1);
s[0][0]=0;
for(int j=1;j<=n;j++)
{
s[0][j]=(((1<<12)&(j))!=0 ? 2 : 1);
}
for(int i=1;i<=25;i+=2)
{
s[i][0]=(i+1)/2;
int bit=12-s[i][0];
s[i][0]=s[i][0]%2;
s[i+1][0]=s[i][0];
for(int j=1;j<=n;j++)
{
int valcheck=(((1<<(bit+1))&(j))!=0 ? 1 : 0);
if(valcheck==1)
{
s[i][j]=(abs(bit)%2==1 ? -1 : -2);
s[i+1][j]=(((1<<bit)&(j))!=0 ? min(26,i+3) : min(26,i+2));
}
else
{
s[i+1][j]=(abs(bit)%2==1 ? -2 : -1);
s[i][j]=(((1<<bit)&(j))!=0 ? min(26,i+3) : min(26,i+2));
}
}
}
return s;
}
