#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N=1050;
char s[4][N];
int len[4];
const int M=N*N;
bool ok1[M],ok2[M];
int nxt[M];
ll add[M];
bool done[M];
int ptr[M];
ll tme[M];
int main(){
	int n;
	scanf("%i",&n);
	for(int i=0;i<4;i++){
		scanf("%s",s[i]);
		len[i]=strlen(s[i]);
	}
	int m1=len[0]*len[1];
	for(int i=0;i<m1;i++){
		if(s[0][i%len[0]]=='T' && s[1][i%len[1]]=='T'){
			ok1[i]=true;
		}
		//printf("%i",ok1[i]);
	}
	//printf("\n");
	int m2=len[2]*len[3];
	for(int i=0;i<m2;i++){
		if(s[2][i%len[2]]=='P' && s[3][i%len[3]]=='C'){
			ok2[i]=true;
		}
		//printf("%i",ok2[i]);
	}
	//printf("\n");
	queue<int> q;
	for(int i=0;i<m2;i++){
		if(ok2[i]){
			q.push(i);
			done[i]=true;
			nxt[i]=i;
			add[i]=0;
		}
	}
	while(q.size()){
		int i=q.front();
		q.pop();
		int j=(i-m1%m2+m2)%m2;
		if(!done[j]){
			done[j]=true;
			add[j]=add[i]+m1;
			nxt[j]=nxt[i];
			q.push(j);
		}
	}
	for(int i=0;i<m2;i++){
		if(ok2[i]){
			if(ok2[(i+m1)%m2]){
				nxt[i]=(i+m1)%m2;
				add[i]=m1;
			}else{
				nxt[i]=nxt[(i+m1)%m2];
				add[i]=add[(i+m1)%m2]+m1;
			}
		}
	}
	/*for(int z=0;z<100;z++){
		for(int i=m2-1;i>=0;i--){
			if(done[i])continue;
			if(ok2[(i+m1)%m2]){
				nxt[i]=(i+m1)%m2;
				add[i]=m1;
				done[i]=true;
			}else if(done[(i+m1)%m2]){
				nxt[i]=nxt[(i+m1)%m2];
				add[i]=add[(i+m1)%m2]+m1;
				done[i]=true;
			}
		}
	}*/
	/*for(int i=0;i<m2;i++){
		printf("(%i %i %lld)\n",done[i],nxt[i],add[i]);
	}
	printf("\n");*/
	priority_queue<pair<ll,int>> pq;
	for(int i=0;i<m1;i++){
		if(ok1[i]){
			if(ok2[i%m2]){
				tme[i]=i+1;
				ptr[i]=i%m2;
			}else if(done[i%m2]){
				tme[i]=i+1+add[i%m2];
				ptr[i]=nxt[i%m2];
			}else{
				continue;
			}
			//printf("i:%i tme:%lld ptr:%i\n",i,tme[i],ptr[i]);
			pq.push({-tme[i],i});
		}
	}
	if(pq.empty()){
		printf("-1\n");
		return 0;
	}
	ll ans=0;
	for(int z=1;z<=n;z++){
		int i=pq.top().second;
		ans=-pq.top().first;
		pq.pop();
		//printf("%lld\n",ans);
		tme[i]+=add[ptr[i]];
		ptr[i]=nxt[ptr[i]];
		//printf("%i %i %i %i\n",tme[i],ptr[i],add[ptr[i]],done[ptr[i]]);
		pq.push({-tme[i],i});
	}
	printf("%lld\n",ans);
	return 0;
}