#line 1 "a.cpp"
#include<iostream>
#include<algorithm>
using namespace std;
#line 1 "/home/kotatsugame/library/datastructure/BIT.cpp"
//1-indexed
#include<vector>
template<typename T>
struct BIT{
	int n;
	vector<T>bit;
	BIT(int n_=0):n(n_),bit(n_+1){}
	T sum(int i)
	{
		T ans=0;
		for(;i>0;i-=i&-i)ans+=bit[i];
		return ans;
	}
	void add(int i,T a)
	{
		if(i==0)return;
		for(;i<=n;i+=i&-i)bit[i]+=a;
	}
	int lower_bound(T k)//k<=sum(ret)
	{
		if(k<=0)return 0;
		int ret=0,i=1;
		while((i<<1)<=n)i<<=1;
		for(;i;i>>=1)
			if(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];
		return ret+1;
	}
};
#line 5 "a.cpp"
int N;
int A[1<<17],B[1<<17],C[2<<17];
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		C[i]=A[i];
	}
	for(int i=0;i<N;i++)
	{
		cin>>B[i];
		C[N+i]=B[i];
	}
	sort(A,A+N);
	sort(C,C+2*N);
	BIT<int>P(2*N);
	long ans=0;
	for(int i=0;i<N;i++)
	{
		P.add(upper_bound(C,C+2*N,B[i])-C,1);
		ans+=P.sum(lower_bound(C,C+2*N,A[i])-C);
	}
	cout<<ans<<endl;
}