#include <bits/stdc++.h>
using namespace std;
int n;
char inp[1005];
vector<int> f;
vector<int> e;
int main() {
  scanf("%d", &n);
  scanf("%s", &inp);
  for (int i = 0; i < n; i++) {
    f.push_back(inp[i] - '0');
  }
  scanf("%s", &inp);
  for (int i = 0; i < n; i++) {
    e.push_back(inp[i] - '0');
  }
  sort(f.begin(), f.end());
  sort(e.begin(), e.end());
  int mn, mx;
  mn = mx = 0;
  for (int i = 0, j = 0; i < n && j < n; i++, j++) {
    while (j < n && e[j] <= f[i]) j++;
    if (j < n) mx++;
  }
  for (int i = 0, j = 0; i < n; i++) {
    while (j < n && e[j] < f[i]) j++;
    if (j < n) {
      j++;
    } else {
      mn++;
    }
  }
  cout << mn << endl << mx << endl;
  return 0;
}
