#include <bits/stdc++.h>
int lcm(int, int);
int main() {
  int a[1000], b[1000], d = 0, x = 0, y = 0, z, k, i, j, e = 0, f = 0, n1, w;
  long int n;
  char s1[1001], s2[1001];
  scanf("%ld", &n);
  scanf("%s %s", s1, s2);
  int l1 = strlen(s1), l2 = strlen(s2);
  z = lcm(l1, l2);
  int m = (n) % z;
  n1 = (n - z) > 0 ? (n / z) : 1;
  w = (n - z) > 0 ? z : n;
  for (k = 1, j = 0, i = 0; k <= w; i++, j++, k++) {
    if (s1[i] == s2[j])
      d++;
    else if ((s1[i] == 'R' && s2[j] == 'S') || (s1[i] == 'S' && s2[j] == 'P') ||
             (s1[i] == 'P' && s2[j] == 'R'))
      x++;
    else
      y++;
    if ((k % l1) == 0) i = -1;
    if ((k % l2) == 0) j = -1;
    if (k == m && (n - z) > 0) {
      e = x;
      f = y;
    }
  }
  x = (x * n1) + e;
  y = (y * n1) + f;
  printf("%d %d ", y, x);
  return 0;
}
int lcm(int a, int b) {
  int i, h;
  h = a > b ? a : b;
  for (i = h; i <= (a * b); i += h) {
    if (i % a == 0 && i % b == 0) {
      return i;
    }
  }
}
