#include <bits/stdc++.h>
using namespace std;
const int N=110;
int n,x,flag=1,b[N],a[N],ret=0,now=1;
int main() {
    freopen("proposal.in","r",stdin);
    freopen("proposal.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&b[i]);
        if (a[i]>b[i])
        {
            flag=0;
        } 
    }
    if (flag)
    {
        printf("0");
        return 0;
    }
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    for (int i=1;i<=n;i++)
    {
        int q=1;
        for (int j=now;j<=n;j++)
        {
            if (a[i]>=b[j])
            {
                now=j+1;
                q=0;
            }
        }
        if (q)
        {
            ret++;
        }
    }
    if (ret==0)
    {
        ret++;
    }
    printf("%d",ret);
}