#include <bits/stdc++.h>
using namespace std;
int solve(bool can_be_equal, const string &sa, vector<int> num_digits) {
  int received = 0;
  int given = 0;
  int offset = can_be_equal ? 0 : 1;
  for (char c : sa) {
    int d = c - '0';
    bool found = false;
    for (int search = d + offset; search < 10; ++search) {
      if (num_digits[search] != 0) {
        num_digits[search]--;
        found = true;
        given++;
        break;
      }
    }
    if (!found) {
      received++;
      for (int search = 0; search < d + offset; ++search) {
        if (num_digits[search] != 0) {
          num_digits[search]--;
          found = true;
          break;
        }
      }
    }
  }
  return can_be_equal ? received : given;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  string sa, sb;
  cin >> sa;
  cin >> sb;
  vector<int> num_digits(10);
  for (char c : sb) {
    num_digits[c - '0']++;
  }
  cout << solve(true, sa, num_digits) << endl;
  cout << solve(false, sa, num_digits) << endl;
  return 0;
}
