#include<cstdio>
#include<iostream>
#include<cstdlib>

using namespace std;
int cmp(const void *a,const void *b)
{
     return *(int *)a-*(int *)b;
} 

int main()
{
	freopen("horsea.in","r",stdin);
	freopen("horsea.out","w",stdout);
	int n;
	cin>>n;
	int king[5005],ji[5005];
	for(int i=1;i<=n;i++)
	{
		cin>>king[i];
	}
	for(int i=1;i<=n;i++)
	{
		cin>>ji[i];
	}
	qsort(king+1,n,sizeof(king[0]),cmp);
	qsort(ji+1,n,sizeof(ji[0]),cmp);
	int temp;
	for(int i=1;i<=n;i++)
	{
		if(king[i]>ji[n])
		{
			temp=i;
			break;
		}
	}
	if(ji[n]==king[temp-1])
	{
		int num1=0,num2=0;
		int kk;
		kk=n;
		for(int i=temp-1;i>=1;i--)
		{
			if(king[i]<ji[kk])
			{
				num1++;
			}
			kk--;
		}
		int ans1,ans2;
		ans1=num1-kk;
		kk=n;
		for(int i=temp-2;i>=1;i--)
		{
			if(king[i]<ji[kk])
			{
				num2++;
			}
			kk--;
		}
		ans2=num2-kk;
		if(ans1>ans2)
			cout<<ans1<<endl;
		else
			cout<<ans2<<endl;
	}
	if(ji[n]!=king[temp-1])
	{
		int num1=0;
		int kk=n;
		for(int i=temp-1;i>=1;i--)
		{
			if(king[i]<ji[kk])
			{
				num1++;
			}
			kk--;
		}
		int ans;
		ans=num1-kk;
		cout<<ans<<endl;
	}
	return 0;
}