#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  string a, b;
  cin >> a >> b;
  map<char, int> mp;
  long long min = 0, max = 0, sam = 0, di = 0;
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  long long k = 0;
  for (int j = n - 1, i = n - 1; i >= 0; i--, j--) {
    if (a[i] > b[j]) {
      j++;
      min++;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[i] < b[j]) {
        max++;
        b[j] = a[i] - 1;
        break;
      }
    }
  }
  cout << min << endl << max << endl;
}
