#include <bits/stdc++.h>
using namespace std;
char s1[1001];
char s2[1001];
struct node {
  int a1, a2;
};
int n1, n2;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
node f(int m) {
  int m1, m2, a1, a2, i;
  node x;
  a1 = a2 = 0;
  for (i = 1; i <= m; i++) {
    if (i % n1 == 0)
      m1 = n1 - 1;
    else
      m1 = i % n1 - 1;
    if (i % n2 == 0)
      m2 = n2 - 1;
    else
      m2 = i % n2 - 1;
    if (s1[m1] == s2[m2]) continue;
    if (s1[m1] == 'R') {
      if (s2[m2] == 'P')
        a1++;
      else
        a2++;
    } else if (s1[m1] == 'P') {
      if (s2[m2] == 'R')
        a2++;
      else
        a1++;
    } else {
      if (s2[m2] == 'P')
        a2++;
      else
        a1++;
    }
  }
  x.a1 = a1;
  x.a2 = a2;
  return x;
}
int main() {
  int n, i, a1, a2, m, x, y;
  node A, B;
  while (~scanf("%d", &n)) {
    a1 = a2 = 0;
    scanf("%s%s", s1, s2);
    n1 = strlen(s1);
    n2 = strlen(s2);
    m = gcd(n1, n2);
    m = n1 / m * n2;
    x = n / m;
    y = n % m;
    A = f(y);
    if (x != 0) B = f(m);
    a1 = A.a1 + B.a1 * x;
    a2 = A.a2 + B.a2 * x;
    printf("%d %d\n", a1, a2);
  }
  return 0;
}
