#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <iostream>#include <algorithm>#include <queue>#include <set>#include <map>#include <sstream>using namespace std;typedef long long ll;#define pb push_back#define rep(i, n) for(int i=0; i<(n); ++i)#define for1(i,a,n) for(int i=(a);i<=(n);++i)#define for2(i,a,n) for(int i=(a);i<(n);++i)#define for3(i,a,n) for(int i=(a);i>=(n);--i)#define for4(i,a,n) for(int i=(a);i>(n);--i)#define CC(i,a) memset(i,a,sizeof(i))#define read(a) a=getint()#define print(a) printf("%d", a)#define dbg(x) cout << (#x) << " = " << (x) << endl#define error(x) (!(x)?puts("error"):0)#define rdm(x, i) for(int i=ihead[x]; i; i=e[i].next)inline int getint() { static int r, k; r=0,k=1; static char c; c=getchar(); for(; c<‘0‘||c>‘9‘; c=getchar()) if(c==‘-‘) k=-1; for(; c>=‘0‘&&c<=‘9‘; c=getchar()) r=r*10+c-‘0‘; return k*r; }const int N=33;int n;int m[3][3], g[3][N];ll f[3][N];int main() {	read(n);	char s[4];	rep(i, 6) {		scanf("%s", s);		int x=s[0]-‘A‘, y=s[1]-‘A‘;		m[x][y]=i;	}	f[0][1]=f[1][1]=f[2][1]=1;	g[0][1]=m[0][1]<m[0][2]?1:2;	g[1][1]=m[1][0]<m[1][2]?0:2;	g[2][1]=m[2][0]<m[2][1]?0:1;	for1(j, 2, n) {		rep(i, 3) {			ll &ans=f[i][j];			ans=f[i][j-1]+1;			int now=3-g[i][j-1]-i;			int nxt=g[i][j-1];			while(g[nxt][j-1]!=now || now==i) {				ans+=f[nxt][j-1]+1;				now=3-g[nxt][j-1]-now;				nxt=g[nxt][j-1];			}			if(g[nxt][j-1]==now) ans+=f[nxt][j-1];			g[i][j]=now;		}	}	printf("%lld\n", f[0][n]);	return 0;}