#include <bits/stdc++.h>
using namespace std;
int n, i, j, t, res, p;
char ch;
int a[10000], b[10000], sa[10000], sb[10000], lista[10000], listb[10000];
int main() {
  cin >> n;
  for (i = 0; i <= n - 1; i++) {
    ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    a[i] = ch - '0';
  }
  for (i = 0; i <= n - 1; i++) {
    ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    b[i] = ch - '0';
  }
  sort(a, a + n);
  sort(b, b + n);
  res = 0;
  p = n - 1;
  for (i = n - 1; i >= 0; i--) {
    while (a[p] > b[i] && p >= 0) p--;
    if (p >= 0) res++;
    p--;
  }
  cout << n - res << endl;
  res = 0;
  p = n - 1;
  for (i = n - 1; i >= 0; i--) {
    while (a[p] >= b[i] && p >= 0) p--;
    if (p >= 0) res++;
    p--;
  }
  cout << res << endl;
  return 0;
}
