#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;
}