#include<cstdio>
#include<algorithm>
#define N 100005
#define mod 9999997
using namespace std;
int n;
long long cnt = 0;
struct match
{
	int h,num,subn;
}a[N],b[N];
bool cmp1(match x,match y)
{
	if(x.h==y.h) return x.num<y.num;
	else return x.h<y.h;
}
bool cmp2(match x,match y){return x.num<y.num;}
void srt(int l,int r)
{
	if(l==r) return ;
	int mid=(l+r)/2;
	int li=l,ri=mid+1;
	srt(l,mid);
	srt(mid+1,r);
	while(1)
	{
		if(li>mid) break;
		else if(ri>r)
		{
			cnt=cnt+(r-mid+1)*(mid-li+1);
		}
		if(a[li].subn<=a[ri].subn) li++;
		else ri++,cnt=(cnt+li-l+1)%mod;
	}
	return ;
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i].h),a[i].num=i;
	for(int i=1;i<=n;i++) scanf("%d",&b[i].h),b[i].num=i;
	sort(a+1,a+n+1,cmp1);
	sort(b+1,b+n+1,cmp1);
	for(int i=1;i<=n;i++)
	{
		a[i].subn=b[i].num;
	}
	sort(a+1,a+n+1,cmp2);
	srt(1,n);
	printf("%lld",cnt);
	return 0;
}