#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int n;
int q[5100],w[5100];
int answer=0;
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);
	cin>>n;
	for (int i=0;i<n;i++)
	{
		cin>>q[i];
	}
	for (int i=0;i<n;i++)
	{
		cin>>w[i];
	}
	qsort(q,n,sizeof(q[0]),cmp);
	qsort(w,n,sizeof(w[0]),cmp);
	for (int i=n-1;i>=0;i--)
	{
		if (q[i]>w[i])
		{
			answer--;
			for (int j=0;j<n-1;j++)
			{
				w[j]=w[j+1];
			}
		}
		if (q[i]<w[i])
		{
			answer++;
		}
		if (q[i]==w[i])
		{
			answer--;
			if (q[i]==w[0])
				answer++;
			for (int j=0;j<n-1;j++)
			{
				w[j]=w[j+1];
			}
		}
	}
	cout<<answer;
	return 0;
}