#include <cmath>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#define N 110000
#define mol 99999997
#define ll long long
using namespace std;

struct node
{
int num,xuhao;
}a[N],b[N];

int c[N],n,d[N];
ll ans;

bool cmp(node x,node y)
{
return x.num<y.num;
}

int lowbit(int x)
{
return x&(x^(x-1));
}

int sum(int x)
{
int ans=0;
while(x>0)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}

void update1(int x,int d)
{
while(x<=n)
{
c[x]+=d;
x+=lowbit(x);
}
}

int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i].num);
a[i].xuhao=i;
}
for(int i=1;i<=n;i++)
{
scanf("%lld",&b[i].num);
b[i].xuhao=i;
}
sort(a+1,a+n+1,cmp);
sort(b+1,b+n+1,cmp);
for(int i=1;i<=n;i++)
d[a[i].xuhao]=b[i].xuhao;
for(int i=1;i<=n;i++)
{
update1(d[i],1);
ans+=i-sum(d[i]);
}
printf("%lld\n",ans%mol);
return 0;
}