#include<fstream>
#include<vector>
#include <algorithm>
#include<cstdlib>
using namespace std;
int main(void)
{
	ifstream fin("horsea.in");
	ofstream fout("horsea.out");
	int n,m=2,num=0,pj=0;
	int i,j;
	vector<int> a;
	vector<int> b;
	fin>>n;
	for(i=0;i<n;i++)
	{
		fin>>m;
		a.push_back(m);
	}
	for(i=0;i<n;i++)
	{
		fin>>m;
		b.push_back(m);
	}
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	m=n;
	for(i=n-1;i>=0;i--)
	{
		bool f=0;
		int p=-1;
		for(j=n-1;j>=0;j--)
		{
			if(a[j]==-1)continue;
			if(b[i]>a[j])
			{
				num++;
				f=1;
				a[j]=-1;
				break;
			}
			if(b[i]==a[j])
				p=j;
		}
		if(p!=-1&&f==0)
		{
			a[p]=-1;
			pj++;
		}
	}
	num=num-(n-num-pj);
	fout<<num;
	fin.close();
	fout.close();
	return 0;
}