#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int S[10] = {0};
  int M[10] = {0};
  int temp;
  cin.get();
  for (int i = 0; i < n; i++) {
    temp = cin.get() - '0';
    S[temp]++;
  }
  cin.get();
  for (int i = 0; i < n; i++) {
    temp = cin.get() - '0';
    M[temp]++;
  }
  cin.get();
  int minM = 0, maxS = 0;
  int indexM = 0;
  int leftover = 0;
  for (int i = 9; i >= 0; i--) {
    if ((S[i] - M[i] - leftover) >= 0) {
      minM += (S[i] - M[i] - leftover);
      leftover = 0;
    } else if ((M[i] + leftover - S[i]) > 0) {
      leftover = M[i] - S[i] + leftover;
    }
  }
  cout << minM << endl;
  leftover = 0;
  indexM = 1;
  for (int i = 9; i >= 1; i--) {
    maxS += min(M[i] + leftover, S[i - 1]);
    leftover =
        ((leftover + M[i] - S[i - 1]) > 0) ? (leftover + M[i] - S[i - 1]) : 0;
  }
  cout << maxS << endl;
}
