#include <bits/stdc++.h>
using namespace std;
bool vis[1005];
int main() {
  int n;
  cin >> n;
  string s1, s2;
  cin >> s1 >> s2;
  sort(s2.begin(), s2.end());
  int cnt1 = 0, cnt2 = 0;
  for (int i = 0; i < s1.size(); i++) {
    bool fnd = false;
    for (int j = 0; j < s2.size(); j++) {
      if (vis[j]) continue;
      if (s2[j] >= s1[i]) {
        fnd = true, vis[j] = true;
        break;
      }
    }
    if (!fnd) {
      for (int j = 0; j < s2.size(); j++)
        if (!vis[j]) {
          vis[j] = true;
          break;
        }
      cnt1++;
    }
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < s1.size(); i++) {
    bool fnd = false;
    for (int j = 0; j < s2.size(); j++) {
      if (vis[j]) continue;
      if (s2[j] > s1[i]) {
        fnd = true, vis[j] = true;
        break;
      }
    }
    if (!fnd) {
      for (int j = 0; j < s2.size(); j++)
        if (!vis[j]) {
          vis[j] = true;
          break;
        }
      cnt2++;
    }
  }
  cout << cnt1 << endl << n - cnt2;
}
