#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005,mod=99999997;
int A[N],B[N],a[N],b[N],l[N],c[5*N];
ll ans;
int n;
void add(int x,int y)
{
	for(;x<=n;x+=x&-x) c[x]+=y;
}
int ask(int x)
{
	ll ans=0;
	for(;x;x-=x&-x) ans+=c[x];
	return ans;
}
bool cmp1(int i,int j){
	return A[i]<A[j];
}
bool cmp2(int i,int j){
	return B[i]<B[j];
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&A[i]),a[i]=i;
	for(int i=1;i<=n;++i) scanf("%d",&B[i]),b[i]=i;
	sort(a+1,a+1+n),sort(b+1,b+1+n);
	sort(a+1,a+1+n,cmp1),sort(b+1,b+1+n,cmp2);
	for(int i=1;i<=n;++i) l[a[i]]=b[i];
	for(int i=n;i;i--)
{
		ans=(ans+ask(l[i]-1))%mod;
		add(l[i],1);	
	}
	printf("%lld",ans%mod);
	return 0;
}