#include <bits/stdc++.h>

using namespace std;

int inv(int a, int m) {
  for (int64_t i = 1; i < m; ++i) if (a * i % m == 1) return i;
  return 1;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  string a, b, c, d; cin >> a >> b >> c >> d;
  int m1 = lcm(a.size(), b.size()), m2 = lcm(c.size(), d.size()), g = gcd(m1, m2);
  vector<vector<int>> v(g), u(g);
  for (int i = 0; i < m1; ++i) if (a[i % a.size()] == 'T' && b[i % b.size()] == 'T') v[i % g].push_back(i / g);
  for (int i = 0; i < m2; ++i) if (c[i % c.size()] == 'P' && d[i % d.size()] == 'C') u[i % g].push_back(i / g);
  m1 /= g, m2 /= g;
  int64_t mm = m1 * (uint64_t)m2;
  int im1 = inv(m1, m2), im2 = inv(m2, m1);
  priority_queue pq{greater{}, vector<tuple<int64_t, int, int, int>>{}};
  auto calc = [&](int i, int j, int k) { return (v[i][j] * (uint64_t)m2 + u[i][k] * (uint64_t)m1) % mm; };
  for (int i = 0; i < g; ++i) {
    for (auto& s: v[i]) s = s * (uint64_t)im2 % m1;
    for (auto& s: u[i]) s = s * (uint64_t)im1 % m2;
    sort(v[i].begin(), v[i].end());
    sort(u[i].begin(), u[i].end());
    for (int j = 0; j < v[i].size() && u[i].size(); ++j) {
      int k = lower_bound(u[i].begin(), u[i].end(), (mm - v[i][j] * (uint64_t)m2 % mm + m1 - 1) / m1) - u[i].begin();
      k %= u[i].size();
      pq.push({calc(i, j, k), i, j, k});
    }
  }
  vector<int64_t> res;
  while (pq.size() && res.size() < n) {
    auto [r, i, j, k] = pq.top(); pq.pop();
    res.push_back(r * g + i);
    auto s = calc(i, j, (k + 1) % u[i].size());
    if (s > r) pq.push({s, i, j, (k + 1) % u[i].size()});
  }
  for (int i = 0; res.size() && res.size() < n; ++i) res.push_back(res[i] + mm * g);
  cout << (res.size()? res.back() + 1: -1) << '\n';
}