#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<cstring>

 #include<cstdlib>

 #include<set>

 #include<map>

 #include<vector>

 #include<stack>

 #include<queue>

 #define ll long long

 #define inf 2147383611

 #define MAXN 100100

 #define MOD 99999997

 using namespace std;

 inline int read()

 {

     int x=,f=;

     char ch;ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) {x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 struct data

 {

     int pos,val;

     bool operator < (const data &a) const

     {

         return val<a.val;

     }

 }a[MAXN],b[MAXN];

 int g1[MAXN],g2[MAXN],k[MAXN],n,c[MAXN],cnt,ans;

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

 void add(int x,int val) {for(int i=x;i<=MAXN;i+=lowbit(i)) c[i]+=val;}

 int sum(int x) {int res=;for(int i=x;i;i-=lowbit(i)) res+=c[i];return res;}

 int main()

 {

     n=read();

     for(int i=;i<=n;i++) a[i].val=read(),a[i].pos=i;

     sort(a+,a+n+);

     for(int i=;i<=n;i++) b[i].val=read(),b[i].pos=i;

     sort(b+,b+n+);

     for(int i=;i<=n;i++) k[a[i].pos]=b[i].pos;

     for(int i=;i<=n;i++)

     {

         ans=((ans+i-)%MOD-sum(k[i]-)%MOD)%MOD;

         add(k[i],);

     }

     printf("%d",ans);

 }