#include <bits/stdc++.h>
using namespace std;
int main() {
  char a[1010], b[1010];
  int c[1010], d[1010];
  int e[1010], f[1010];
  int n;
  scanf("%d", &n);
  scanf("%s", a);
  scanf("%s", b);
  for (int i = 0; i < n; i++) {
    c[i] = a[i] - '0';
    d[i] = b[i] - '0';
  }
  sort(c, c + n);
  sort(d, d + n);
  for (int i = 0; i < n; i++) {
    e[i] = c[i];
    f[i] = d[i];
  }
  int s1 = 0, s2 = 0;
  for (int i = 0; i < n; i++) {
    int flag = 1;
    for (int j = 0; j < n; j++) {
      if (e[i] <= f[j]) {
        flag = 0;
        f[j] = -1;
        break;
      }
    }
    if (flag) s1++;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (c[i] < d[j]) {
        s2++;
        d[j] = 0;
        break;
      }
    }
  }
  printf("%d\n%d", s1, s2);
  return 0;
}
