#include <bits/stdc++.h>
int a[1001], b[1001], mi[10], ma[10], n;
void fmin() {
  int flk = n;
  for (int i = 1; i <= n; i++) {
    if (mi[a[i]]) {
      flk--;
      mi[a[i]]--;
      a[i] = -1;
    }
  }
  if (flk) {
    for (int i = 1; i <= n; i++) {
      if (a[i] >= 0 && a[i] < 9) {
        int j = a[i] + 1;
        while (mi[j] == 0 && j < 9) j++;
        if (mi[j]) {
          mi[j]--;
          flk--;
          a[i] = -1;
        }
      }
    }
  }
  printf("%d\n", flk);
}
void fmax() {
  int flk = 0;
  for (int i = 1; i <= n; i++) {
    if (b[i] < 9) {
      int j = b[i] + 1;
      while (ma[j] == 0 && j < 9) j++;
      if (ma[j]) {
        ma[j]--;
        flk++;
      }
    }
  }
  printf("%d\n", flk);
}
int main() {
  char c;
  scanf("%d", &n);
  scanf("%c", &c);
  for (int i = 1; i <= n; i++) {
    scanf("%c", &c);
    a[i] = c - 48;
    b[i] = c - 48;
  }
  scanf("%c", &c);
  for (int i = 1; i <= n; i++) {
    scanf("%c", &c);
    mi[c - 48]++;
    ma[c - 48]++;
  }
  fmin();
  fmax();
}
