#include <bits/stdc++.h>
#pragma GCC optimize("O3")
const int N = 100000 + 5;
const int OO = 1e9;
const long long MOD = 1000000007;
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, ans = 0, pr = 0;
  cin >> n;
  string s, m, e;
  cin >> s >> m;
  e = m;
  for (int i = 0; i < n; i++) {
    long long mn = 1e010, cnt = 0, idx = -1;
    for (int j = 0; j < n; j++) {
      long long fs = s[i] - '0';
      long long sec = m[j] - '0';
      if (sec >= fs && m[j] != '?') {
        if (sec - fs < mn) {
          mn = sec - fs;
          idx = j;
        }
      }
    }
    if (idx != -1) pr++, m[idx] = '?';
  }
  cout << n - pr << "\n";
  m = e;
  for (int i = 0; i < n; i++) {
    long long mn = 1e010, cnt = 0, idx = -1;
    for (int j = 0; j < n; j++) {
      long long fs = s[i] - '0';
      long long sec = m[j] - '0';
      if (sec > fs && m[j] != '?') {
        if (sec - fs < mn) {
          mn = sec - fs;
          idx = j;
        }
      }
    }
    if (idx != -1) ans++, m[idx] = '?';
  }
  cout << ans << '\n';
  return 0;
}
