#include <bits/stdc++.h>
using namespace std;
int n, ans1 = 0, ans2 = 0, x, y;
char s[1100], m[1100];
int main() {
  scanf("%d", &n);
  scanf("%s%s", s, m);
  sort(s, s + n);
  sort(m, m + n);
  x = y = 0;
  while (x < n && y < n) {
    if (m[y] >= s[x]) {
      x++;
      y++;
    } else
      y++, ans1++;
  }
  x = y = 0;
  while (x < n && y < n) {
    if (m[y] > s[x]) {
      x++;
      y++;
      ans2++;
    } else
      y++;
  }
  printf("%d\n%d", ans1, ans2);
  return 0;
}
