#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod=99999997;
LL nixudui=0;
struct nd{
    LL num,id;
    bool operator<(const nd& a) const{return num<a.num;}
}arr[100005],brr[100005];
int n,a[100005],tmp[100005];
void merge(int l,int m,int r){
    int L=l,R=m+1,pos=0;
    while (L<=m||R<=r){
        if (R>r){tmp[++pos]=a[L++];}
        else if (L<=m&&a[L]>a[R]){
            (nixudui+=r+1-R)%=mod;
            tmp[++pos]=a[L++];
        }else{
            tmp[++pos]=a[R++];
        }
    }
    for (int i=l;i<=r;++i){
        a[i]=tmp[i-l+1];
    }
}
void mergesort(int l,int r){
    if (l>=r){return;}
    int mid=(l+r)>>1;
    mergesort(l,mid);
    mergesort(mid+1,r);
    merge(l,mid,r);
    return;
}
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;++i){scanf("%lld",&arr[i].num);arr[i].id=i;}
    for (int i=1;i<=n;++i){scanf("%lld",&brr[i].num);brr[i].id=i;}
    sort(arr+1,arr+1+n);
    sort(brr+1,brr+1+n);
    for (int i=1;i<=n;++i){a[brr[i].id]=arr[i].id;}
    mergesort(1,n);
    printf("%lld",nixudui);
    return 0;
}