#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n,a[200005],b[200005];

int main()
{
	freopen("horsea.in","r",stdin);
	freopen("horsea.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&b[i]);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	sort(a+1,a+n+1),sort(b+1,b+n+1);
	int ls=1,lt=1,rs=n,rt=n,ans=0;
	for(int i=1;i<=n;i++){
		if(a[rs]>b[rt])ans+=1,--rs,--rt;
		else if(a[rs]<b[rt])ans-=1,++ls,--rt;
		else if(a[ls]>b[lt])ans+=1,++ls,++lt;
		else {
			if(a[ls]<b[rt])ans-=1,++ls,--rt;
		}
	}
	printf("%d\n",ans);
	return 0;
}