#include<bits/stdc++.h>

#define fi first
#define se second
#define pb push_back

using namespace std;

typedef long long ll;
#define int ll

ll euclid(ll a, ll b, ll& x, ll& y)
{
    if (!b) return x = 1, y = 0, a;
    ll d = euclid(b, a%b, y, x);
    return y -= a/b * x, d;
}

int n;
int N;
int A, B;
int X, Y;
vector<int> a, b;
vector<vector<int> > ga;
vector<vector<int> > gb;

void solve()
{
//    cout<<A<<" : ";
//    for (int i : a)
//        cout<<i<<" ";
//    cout<<"\n";
//    cout<<B<<" : ";
//    for (int i : b)
//        cout<<i<<" ";
//    cout<<"\n";

    int g = __gcd(A, B);
    N = A*B/g;

    euclid(A, B, X, Y);

    int CA = (1 - X*A/g)%N;
    CA = (CA + N)%N;
    int CB = X*A/g;
    CB = (CB + N)%N;

//    for (int i : a)
//        for (int j : b)
//            if (i%g == j%g)
//    {
//        int s = CA*i + CB*j;
//        s %= N;
//        cout<<s%A<<" "<<s%B<<" "<<i<<" "<<j<<"\n";
//    }
    ga.resize(g);
    gb.resize(g);
    for (int i : a)
        ga[i%g].pb(i*CA%N);
    for (int i : b)
        gb[i%g].pb(i*CB%N);
    for (int i=0; i<g; i++)
        sort(ga[i].begin(), ga[i].end()), sort(gb[i].begin(), gb[i].end());

//    cout<<"\nA : \n";
//    for (int i=0; i<g; i++)
//    {
//        cout<<i<<" : ";
//        for (int j : ga[i])
//            cout<<j<<" ";
//        cout<<"\n";
//    }
//    cout<<"\nB : \n";
//    for (int i=0; i<g; i++)
//    {
//        cout<<i<<" : ";
//        for (int j : gb[i])
//            cout<<j<<" ";
//        cout<<"\n";
//    }

    int total = 0;
    for (int i=0; i<g; i++)
        total += ga[i].size() * gb[i].size();
    if (total == 0)
    {
        cout<<"-1\n";
        return;
    }

    int rounds = (n-1)/total;
    n -= rounds*total;

    set<array<int, 4> > st;
    /// [pos, i, j1, j2]
    for (int i=0; i<g; i++)
        if (gb[i].size() > 0)
            for (int j1=0; j1<int(ga[i].size()); j1++)
    {
        auto it = lower_bound(gb[i].begin(), gb[i].end(), N-ga[i][j1]);
        int j2 = 0;
        if (it != gb[i].end())
            j2 = it - gb[i].begin();

        st.insert({ (ga[i][j1] + gb[i][j2])%N, i, j1, j2 });
    }

    int cnt = 0;
    int last = 0;
//    cout<<n<<" "<<rounds<<" "<<N<<"\n";
    while (cnt < n)
    {
        auto [p, i, j1, j2] = *st.begin();
//        cout<<p<<" "<<i<<" "<<j1<<" "<<j2<<"\n";
        st.erase(st.begin());
        last = p;
        cnt++;

        j2 = (j2 + 1)%gb[i].size();
        int pnew = (ga[i][j1] + gb[i][j2])%N;
        while (pnew < p)
            pnew += N;

        st.insert({ pnew, i, j1, j2 });
    }
    cout<<rounds*N+last+1<<"\n";
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n;
    string s[4];
    for (int i=0; i<4; i++)
        cin>>s[i];

//    int n0 = n;
//    for (int pos=0; ; pos++)
//        if (s[0][pos%s[0].size()] == 'T' && s[1][pos%s[1].size()] == 'T')
//        if (s[2][pos%s[2].size()] == 'P' && s[3][pos%s[3].size()] == 'C')
//    if (--n0 == 0)
//    {
//        cout<<pos+1<<"\n";
//        break;
//    }


    int pos = 0;
    for (int i=0; i<int(s[0].size()); i++)
        for (int j=0; j<int(s[1].size()); j++)
    {
        if (s[0][pos%s[0].size()] == 'T' && s[1][pos%s[1].size()] == 'T')
            a.pb(pos);
        pos++;
    }
    A = pos;

    pos = 0;
    for (int i=0; i<int(s[2].size()); i++)
        for (int j=0; j<int(s[3].size()); j++)
    {
        if (s[2][pos%s[2].size()] == 'P' && s[3][pos%s[3].size()] == 'C')
            b.pb(pos);
        pos++;
    }
    B = pos;

    solve();
}

/*
1522
TATATTTATTATTTA
ATATTTATATATT
PAPAPPAPAPPAPAPAP
CCDCCDCDCCC
*/