#include <bits/stdc++.h>
using namespace std;
int compare(int a, int b) { return b < a; }
int main() {
  int n;
  cin >> n;
  int a[n], b[n];
  string s;
  int i;
  cin >> s;
  for (i = 0; i < n; i++) a[i] = s[i] - 48;
  cin >> s;
  for (i = 0; i < n; i++) b[i] = s[i] - 48;
  sort(a, a + n);
  sort(b, b + n);
  int j, k, l, t;
  int sa = 0, sb = 0, ma = n + 1, mb = 0;
  for (i = 0; i < n; i++) {
    t = 0;
    k = 0;
    j = i;
    sa = 0;
    sb = 0;
    while (t < n && k < n) {
      if (a[k] > b[j])
        sa++;
      else if (a[k] < b[j])
        sb++;
      k++;
      j = (j + 1) % n;
      t++;
    }
    ma = min(ma, sa);
    mb = max(mb, sb);
  }
  sort(b, b + n, compare);
  for (i = 0; i < n; i++) {
    t = 0;
    k = 0;
    sa = 0;
    sb = 0;
    j = i;
    while (t < n && k < n) {
      if (a[k] > b[j])
        sa++;
      else if (a[k] < b[j])
        sb++;
      k++;
      j = (j + 1) % n;
      t++;
    }
    ma = min(ma, sa);
    mb = max(mb, sb);
  }
  cout << ma << endl;
  cout << mb;
}
