#include<cstdio>
#include<algorithm>
#include<unordered_map>
#define N 100005
#define ll long long
using namespace std;
ll n,a[N],b[N],c[N],d[N],t[N],ans;
unordered_map<int,int>mp;
bool cmp(int x,int y){return a[x]<a[y];}
void ud(ll x){while(x<=n)t[x]++,x+=x&-x;}
ll gs(int x){ll sum=0;while(x)sum+=t[x],x&=x-1;return sum;}
ll read(){
    ll sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
int main(){
    freopen("MatchNOIP2013.in","r",stdin);freopen("MatchNOIP2013.out","w",stdout);
    n=read();
    for(int i=1;i<=n;i++)a[i]=read(),b[i]=i;
    sort(b+1,b+n+1,cmp);
    for(int i=1;i<=n;i++)c[i]=d[i]=read();
    sort(c+1,c+n+1);
    for(int i=1;i<=n;i++)mp[c[i]]=b[i];
    for(int i=1;i<=n;i++)a[i]=mp[d[i]];
    for(int i=n;i;i--)ud(a[i]),ans+=gs(a[i]-1);
    printf("%lld",ans%99999997);
    return 0;
}