//shjj-bzoj1019
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
long long f[30+3];int U[8],V[8],a[5][5],n;char s3[3];
int sol(int n)
{
for (int i=n;i>=1;i--) a[1][++a[1][0]]=i;
int pre=0,ss=0;a[2][0]=a[3][0]=0;
for (;a[2][0]!=n&&a[3][0]!=n;)
{
for (int i=1;i<=6;i++)
if (a[U[i]][0]&&pre!=U[i]&&((!a[V[i]][0])||a[U[i]][a[U[i]][0]]<a[V[i]][a[V[i]][0]]))
{a[V[i]][++a[V[i]][0]]=a[U[i]][a[U[i]][0]];pre=V[i];a[U[i]][0]--;break;}
ss++;
}
return ss;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=6;i++) {scanf("%s",s3+1);U[i]=s3[1]-'A'+1,V[i]=s3[2]-'A'+1;}
f[1]=1;f[2]=sol(2);f[3]=sol(3);
int A=(f[3]-f[2])/(f[2]-f[1]),B=f[2]-f[1]*A;
//f[i]=f[i-1]*A+B;
for (int i=4;i<=n;i++) f[i]=f[i-1]*A+B;
printf("%lld",f[n]);
}