#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
int n;
int main()
{
	read(n);
	vector<int>a(n),b(n);
	for(int &x:a) read(x);
	for(int &x:b) read(x);
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	int ans=0,cur=1;
	while(a.size())
	{
		if(a.back()<b[0])
		{
			break;
		}
		if(b.back()<a[0])
		{
			if(cur) ans+=n;
			break;
		}
		pair<int,int>best={-1e9,0};
		for(int i=0,j=0;i<n;++i)
		{
			while(j<n&&a[i]>=b[j]) ++j;
			if(j==n) continue;
			if(i-j>best.first-best.second)
				best={i,j};
		}
		int i=best.first,j=best.second;
		a.erase(a.begin()+i);
		b.erase(b.begin()+j);
		swap(a,b);
		if(!cur) ++ans;
		--n,cur^=1;
	}
	printf("%d\n",ans);
}