#include <iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>

using namespace std ;

#define LL long long
#define MAXN 1010
char s1[MAXN],s2[MAXN];
int a[15],b[15];
int c[15],d[15];

int main()
{
    int n;
    scanf("%d",&n);
    scanf("%s%s",s1,s2);
    int i;
    for(i=0;i<n;i++)
    {
        a[s1[i]-‘0‘]++;
        b[s2[i]-‘0‘]++;
    }
    for(i=0;i<10;i++)
    {
        c[i]=a[i];
        d[i]=b[i];
    }
    int j=0;
    i=0;
    int ans1=n;
    while(1)
    {
        while(a[i]<=0&&i<=9)
            i++;
        while(j<=9&&(j<i||b[j]<=0))
            j++;
        if(i==10||j==10)
            break;
        while(a[i]>0&&b[j]>0)
        {
            a[i]--;
            b[j]--;
            ans1--;
        }
    }
    int ans2=0;
    i=9,j=9;
    while(1)
    {
        while(d[j]<=0&&j>=0)
            j--;
        while((c[i]<=0||i>=j)&&i>=0)
            i--;
        if(j==-1||i==-1)
            break;
        while(c[i]>0&&d[j]>0)
        {
            c[i]--;
            d[j]--;
            ans2++;
        }
    }
    printf("%d\n%d\n",ans1,ans2);
    return 0 ;
}