65ptsQAQ

#include<bits/stdc++.h>
using namespace std;
long long n,az[1000005],af[1000005],bz[1000005],bf[1000005];
long long caz,caf,cbz,cbf,ipt,ans;
int cmp(int x,int y){return abs(x)<=abs(y);}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>ipt;
		if(ipt>0)az[++caz]=ipt;
		else af[++caf]=abs(ipt);
	}
	for(int i=1;i<=n;i++){
		cin>>ipt;
		if(ipt>0)bz[++cbz]=ipt;
		else bf[++cbf]=abs(ipt);
	}
	sort(az+1,az+caz+1);sort(af+1,af+caf+1);
	sort(bz+1,bz+cbz+1);sort(bf+1,bf+cbf+1);
	int j=1;
	for(int i=1;i<=caz&&j<=cbf;i++)
		if(az[i]<bf[j])ans++,j++;
	j=1;
	for(int i=1;i<=caf&&j<=cbz;i++)
		if(af[i]>bz[j])ans++,j++;
	cout<<ans;
	return 0;
}