//一步步模拟,哎,自己可怜兮兮的弄了一个模型
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[24];
int n,res,t,tt;
void judge()
{
int sum=0;
if(a[0]==a[1]&&a[1]==a[2]&&a[2]==a[3]) sum++;
if(a[4]==a[5]&&a[5]==a[10]&&a[10]==a[11]) sum++;
if(a[6]==a[7]&&a[7]==a[12]&&a[12]==a[13]) sum++;
if(a[8]==a[9]&&a[9]==a[14]&&a[14]==a[15]) sum++;
if(a[16]==a[17]&&a[17]==a[18]&&a[18]==a[19])sum++;
if(a[20]==a[21]&&a[21]==a[22]&&a[22]==a[23])sum++;
if(sum>res)
res=sum;
}
const int tra[6][24]={
{2,0,3,1,6,7,8,9,23,22,10,11,12,13,14,15,16,17,18,19,20,21,5,4},
{1,3,0,2,23,22,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,9,8},
{0,1,11,5,4,16,12,6,2,9,10,17,13,7,3,15,14,8,18,19,20,21,22,23},
{0,1,8,14,4,3,7,13,17,9,10,2,6,12,16,15,5,11,18,19,20,21,22,23},
{0,21,2,23,4,5,6,1,9,15,10,11,12,3,8,14,16,7,18,13,20,17,22,19},
{0,7,2,13,4,5,6,17,14,8,10,11,12,19,15,9,16,21,18,23,20,1,22,3}
};
void dfs(int x)
{
int s[24];
if(res==6)return ;
if(x>=n)return ;
memcpy(s,a,sizeof(a));
for(int i=0;i<6;i++)
{
memcpy(a,s,sizeof(s));
for(int j=0;j<24;j++)
a[j]=s[tra[i][j]];
judge();
dfs(x+1);
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("D:\\o.txt","r",stdin);
#endif // ONLINE_JUDGE
while(scanf("%d",&n)!=EOF)
{
res=0;
for(int i=0;i<24;i++)
scanf("%d",&a[i]);
judge();
dfs(0);
printf("%d\n",res);
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[24];
int n,res,t,tt;
int q[340000][24];
int dist[340000];
void judge()
{
int sum=0;
if(a[0]==a[1]&&a[1]==a[2]&&a[2]==a[3]) sum++;
if(a[4]==a[5]&&a[5]==a[10]&&a[10]==a[11]) sum++;
if(a[6]==a[7]&&a[7]==a[12]&&a[12]==a[13]) sum++;
if(a[8]==a[9]&&a[9]==a[14]&&a[14]==a[15]) sum++;
if(a[16]==a[17]&&a[17]==a[18]&&a[18]==a[19])sum++;
if(a[20]==a[21]&&a[21]==a[22]&&a[22]==a[23])sum++;
if(sum>res)
res=sum;
}
const int tra[6][24]={
{2,0,3,1,6,7,8,9,23,22,10,11,12,13,14,15,16,17,18,19,20,21,5,4},
{1,3,0,2,23,22,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,9,8},
{0,1,11,5,4,16,12,6,2,9,10,17,13,7,3,15,14,8,18,19,20,21,22,23},
{0,1,8,14,4,3,7,13,17,9,10,2,6,12,16,15,5,11,18,19,20,21,22,23},
{0,21,2,23,4,5,6,1,9,15,10,11,12,3,8,14,16,7,18,13,20,17,22,19},
{0,7,2,13,4,5,6,17,14,8,10,11,12,19,15,9,16,21,18,23,20,1,22,3}
};
void bfs()
{
int s[24];
int front=0,rear=0;
memcpy(q[rear++],a,sizeof(a));
dist[0]=0;
while(rear>front)
{
memcpy(a,q[front],sizeof(a));
judge();
memcpy(s,a,sizeof(a));
for(int i=0;i<6;i++)
{
memcpy(a,s,sizeof(s));
for(int j=0;j<24;j++)
a[j]=s[tra[i][j]];
dist[rear]=dist[front]+1;
if(dist[rear]<=n)
memcpy(q[rear++],a,sizeof(a));
}
front++;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("D:\\o.txt","r",stdin);
#endif // ONLINE_JUDGE
while(scanf("%d",&n)!=EOF)
{
res=0;
for(int i=0;i<24;i++)
scanf("%d",&a[i]);
judge();
bfs();
printf("%d\n",res);
}
return 0;
}