#include <bits/stdc++.h>
using namespace std;
int N;
char s[1005], z[1005];
int solve1() {
  int ans = 0;
  int lz, rz, ls, rs;
  lz = ls = 0;
  rz = rs = N - 1;
  while (ls <= rs) {
    if (z[rz] >= s[rs])
      rz--, rs--;
    else
      ans++, lz++, rs--;
  }
  return ans;
}
int solve2() {
  int ans = 0;
  int lz, rz, ls, rs;
  lz = ls = 0;
  rz = rs = N - 1;
  while (ls <= rs) {
    if (z[rz] > s[rs])
      ans++, rz--, rs--;
    else
      lz++, rs--;
  }
  return ans;
}
int main() {
  scanf("%d%s%s", &N, s, z);
  sort(s, s + N);
  sort(z, z + N);
  printf("%d\n%d", solve1(), solve2());
  return 0;
}
