#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  int m[10] = {0};
  int p[10] = {0};
  cin >> n;
  for (int i(0); i < n; i++) {
    char a;
    cin >> a;
    m[a - '0']++;
  }
  for (int i(0); i < n; i++) {
    char a;
    cin >> a;
    p[a - '0']++;
  }
  int res1 = 0, res2 = 0;
  int pred = 0;
  for (int i(0); i <= 9; i++) {
    if (m[i] > p[i]) {
      pred += m[i] - p[i];
    } else
      pred = max(0, m[i] - p[i] + pred);
  }
  res1 = pred;
  pred = m[0];
  for (int i(1); i <= 9; i++) {
    if (p[i] > pred) {
      res2 += pred;
      pred = m[i];
    } else {
      res2 += p[i];
      pred = pred - p[i] + m[i];
    }
  }
  cout << res1 << endl << res2;
  return 0;
}
