#include<bits/stdc++.h>
using namespace std;
int t;string s1,s2,s3,s4;
int n,m;
bool a[1001000],b[1010010];
int nx[1010000],ts[1010000];
#define ll long long
struct qq{
	int u;ll di;
	bool operator < (const qq &a) const{
		return a.di<di;
	}
};
priority_queue<qq>q;
int main(){
	cin>>t>>s1>>s2>>s3>>s4;
	int l1=s1.size(),l2=s2.size();n=l1*l2; 
	for(int i=0;i<n;i++)a[i]=(s1[i%l1]=='T'&&s2[i%l2]=='T');
	int l3=s3.size(),l4=s4.size();m=l3*l4;
	for(int i=0;i<m;i++)b[i]=(s3[i%l3]=='P'&&s4[i%l4]=='C');
	if(n>m){swap(n,m);for(int i=0;i<m;i++)swap(a[i],b[i]);}
	memset(nx,-1,sizeof(nx));
	memset(ts,-1,sizeof(ts));
	for(int i=0;i<m;i++)if(b[i]){
		ts[i]=0,nx[i]=i;
		int u=(i+m-n)%m,e=0;
		while(!b[u])nx[u]=i,ts[u]=++e,u=(u+m-n)%m;
	}
	for(int i=0;i<n;i++)if(a[i]){
		if(nx[i]==-1)continue;
		q.push((qq){nx[i],1ll*ts[i]*n+i});
	}
	if(q.empty()){puts("-1");return 0;}
	while(!q.empty()&&t){
		t--;
		qq o=q.top();q.pop();
		if(!t){printf("%lld",o.di+1);return 0;}
		int u=o.u;
		q.push((qq){nx[(u+n)%m],o.di+1ll*(ts[(u+n)%m]+1)*n});
	}
	return 0;
}