#include <iostream>
#include <algorithm>
using namespace std;
int n;
char a[1002], b[1002];
char binary_search(){
}
int main(){
cin >> n;
char c;
for (int i = 1; i <= n; i++){
cin >> c;
a[i] = c;
}
for (int i = 1; i <= n; i++){
cin >> c;
b[i] = c;
}
int mn = 0, mx=0;
sort(a+1, a+n+1);
sort(b+1, b+n+1);
int j = 1;
for (int i = 1; i <= n; i++){
if (b[i]>=a[j]){
j++;
continue;
}else{
mn++;
}
}
j = 1;
cout << mn<< endl;
for (int i = 1; i <= n; i++){
if (b[i] <= a[j]) continue;
else{
mx++;
j++;
}
}
cout << mx << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBuOwpjaGFyIGFbMTAwMl0sIGJbMTAwMl07CiAKY2hhciBiaW5hcnlfc2VhcmNoKCl7CgkKfQogCmludCBtYWluKCl7CgljaW4gPj4gbjsKCWNoYXIgYzsKCWZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKyl7CgkJY2luID4+IGM7CgkJYVtpXSA9IGM7CQoJfQoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKXsKCQljaW4gPj4gYzsKCQliW2ldID0gYzsKCX0KCWludCBtbiA9IDAsIG14PTA7Cglzb3J0KGErMSwgYStuKzEpOwoJc29ydChiKzEsIGIrbisxKTsKCWludCBqID0gMTsKCWZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKyl7CgkJaWYgKGJbaV0+PWFbal0pewoJCQlqKys7CgkJCWNvbnRpbnVlOwoJCX1lbHNlewoJCQltbisrOwoJCX0KCX0KCWogPSAxOwoJY291dCA8PCBtbjw8IGVuZGw7Cglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspewoJCWlmIChiW2ldIDw9IGFbal0pIGNvbnRpbnVlOwoJCWVsc2V7CgkJCW14Kys7CgkJCWorKzsKCQl9Cgl9Cgljb3V0IDw8IG14IDw8IGVuZGw7CQoJcmV0dXJuIDA7Cn0=