#include <bits/stdc++.h>
using namespace std;
int cnt1[1000000];
int cnt2[1000000];
int res(char a, char b) {
  if (a == 'S') {
    if (b == 'S') return 0;
    if (b == 'R') return 1;
    return 2;
  }
  if (a == 'R') {
    if (b == 'R') return 0;
    if (b == 'P') return 1;
    return 2;
  }
  if (b == 'P') return 0;
  if (b == 'S') return 1;
  return 2;
}
int main() {
  int n;
  cin >> n;
  string s1, s2;
  cin >> s1 >> s2;
  int k = s1.length();
  int m = s2.length();
  int q;
  q = res(s1[0], s2[0]);
  if (q == 1) {
    cnt1[0] = 1;
    cnt2[0] = 0;
  } else if (q == 2) {
    cnt1[0] = 0;
    cnt2[0] = 1;
  } else {
    cnt1[0] = 0;
    cnt2[0] = 0;
  }
  for (int i = 1; i < k * m; i++) {
    q = res(s1[i % k], s2[i % m]);
    if (q == 1) {
      cnt1[i] = cnt1[i - 1] + 1;
      cnt2[i] = cnt2[i - 1];
    } else if (q == 2) {
      cnt1[i] = cnt1[i - 1];
      cnt2[i] = cnt2[i - 1] + 1;
    } else {
      cnt1[i] = cnt1[i - 1];
      cnt2[i] = cnt2[i - 1];
    }
  }
  int z = n / (k * m);
  int w = n % (k * m);
  {
    printf("%d %d", cnt1[k * m - 1] * z + (w > 0 ? cnt1[w - 1] : 0),
           cnt2[k * m - 1] * z + (w > 0 ? cnt2[w - 1] : 0));
  }
}
