#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
 
template<class A, class B> string to_string(const pair<A, B> &p);
template<class A, class B, class C> string to_string(const tuple<A, B, C> &p);
template<class A, class B, class C, class D> string to_string(const tuple<A, B, C, D> &p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string) s); }
string to_string(char c) { return "'" + string(1, c) + "'"; }
string to_string(bool x) { return x ? "true" : "false"; }
template<size_t L> string to_string(const bitset<L> &x) { return x.to_string(); }
template<class A, class T = typename A::value_type> string to_string(const A &v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
template<class A, class B> string to_string(const pair<A, B> &p) {
	return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template<class A, class B, class C> string to_string(const tuple<A, B, C> &p) {
	return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template<class A, class B, class C, class D> string to_string(const tuple<A, B, C, D> &p) {
	return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(const H& h, const T&... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#ifndef ONLINE_JUDGE
	#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
	#define debug(...) if (0) puts("No effect.")
#endif

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;


int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	string as, bs, cs, ds; cin >> as >> bs >> cs >> ds;
	int n = sz(as) * sz(bs) / gcd(sz(as), sz(bs));
	int m = sz(cs) * sz(ds) / gcd(sz(cs), sz(ds));
	vector<int> xs(n), ys(m);
	rep(i, 0, n - 1) if (as[i % sz(as)] == 'T' && bs[i % sz(bs)] == 'T') xs[i] = 1;
	rep(i, 0, m - 1) if (cs[i % sz(cs)] == 'P' && ds[i % sz(ds)] == 'C') ys[i] = 1;
	int g = gcd(n, m);
	vector<int> cnt1(g), cnt2(g);
	rep(i, 0, n - 1) cnt1[i % g] += xs[i];
	rep(i, 0, m - 1) cnt2[i % g] += ys[i];
	ll sum = 0;
	rep(i, 0, g - 1) sum += 1ll * cnt1[i] * cnt2[i];

	if (sum == 0) {
		puts("-1");
	} else {
		t--;
		ll base = 1ll * t / sum * (1ll * n * m / gcd(n, m));
		t = t % sum + 1;
		vector<pii> mp(m, pii{-1, -1});
		vector<vector<int>> zs;
		rep(i, 0, n - 1) if (xs[i] == 1) {
			int j = i % m;
			if (mp[j] == pii{-1, -1}) {
				int x = sz(zs);
				int y = 0;
				int now = j;
				vector<int> ts;
				while (mp[now] == pii{-1, -1}) {
					mp[now] = pii{x, y++};
					ts.push_back(ys[now]);
					now = (now + n) % m;
				}
				zs.push_back(move(ts));
			}
		}
		vector<vector<int>> pres(sz(zs));
		rep(r, 0, sz(zs) - 1) {
			pres[r].resize(sz(zs[r]) * 2 + 1);
			rep(i, 0, sz(pres[r]) - 2) {
				pres[r][i + 1] = pres[r][i] + zs[r][i % sz(zs[r])];
			}
		}

		auto check = [&](ll thr) -> bool {
			ll sum = 0;
			rep(i, 0, n - 1) if (xs[i] == 1) {
				int j = i % m;
				auto [x, y] = mp[j];
				int len = thr / n + (thr % n > i);
				sum += pres[x][y + len] - pres[x][y];
			}
			return sum >= t;
		};

		ll l = 1, r = 1ll * n * m / gcd(n, m);
		while (l < r) {
			ll mid = (l + r) >> 1;
			if (check(mid)) r = mid;
			else l = mid + 1;
		}
		ll ans = base + r;
		printf("%lld\n", ans);
	}
	return 0;
}