#include <bits/stdc++.h>
using namespace std;
int for_sorting_sherlock[10];
int for_sorting_moriarty[10];
int main() {
  int n;
  cin >> n;
  string sherlock, moriarty;
  cin >> sherlock >> moriarty;
  for (int i = 0; i < sherlock.length(); i++) {
    for_sorting_sherlock[sherlock[i] - '0']++;
  }
  int j = 0;
  for (int i = 0; i < 10;) {
    if (for_sorting_sherlock[i] >= 1) {
      sherlock[j++] = i;
      for_sorting_sherlock[i]--;
    } else
      i++;
  }
  for (int i = 0; i < moriarty.length(); i++) {
    for_sorting_moriarty[moriarty[i] - '0']++;
  }
  j = 0;
  for (int i = 0; i < 10;) {
    if (for_sorting_moriarty[i] >= 1) {
      moriarty[j++] = i;
      for_sorting_moriarty[i]--;
    } else
      i++;
  }
  int count = 0;
  int i = 0, k = 0;
  while (i < n && k < n) {
    if (moriarty[i] >= sherlock[k]) {
      k++;
    } else
      count++;
    i++;
  }
  cout << count << endl;
  i = 0;
  k = 0;
  count = 0;
  while (k < n && i < n) {
    if (moriarty[k] > sherlock[i]) {
      i++;
      count++;
    }
    k++;
  }
  cout << count;
  return 0;
}
