#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e5+10,mod=1e8-3;
int n,a[N],b[N],c[N],book1[N],book2[N],t[N],tot1,tot2,ans,tree[N];
int lowbit(int x){return x&(-x);}
void add(int x,int t){
    for(;x<=n;x+=lowbit(x))tree[x]+=t;
    return;
}
int sum(int x){
    int cnt=0;
    for(;x>0;x-=lowbit(x))cnt=(cnt+tree[x])%mod;
    return cnt;
}
int main(){
	freopen("MatchNOIP2013.in","r",stdin);
    freopen("MatchNOIP2013.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",a+i),book1[++tot1]=a[i];
    for(int i=1;i<=n;i++)scanf("%d",b+i),book2[++tot2]=b[i];
    sort(book1+1,book1+1+tot1);
    tot1=unique(book1+1,book1+1+tot1)-(book1+1);
    sort(book2+1,book2+1+tot2);
    tot2=unique(book2+1,book2+1+tot2)-(book2+1);
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(book1+1,book1+1+tot1,a[i])-book1;
        b[i]=lower_bound(book2+1,book2+1+tot2,b[i])-book2;
        t[a[i]]=i;
    }
    for(int i=1;i<=n;i++)c[i]=t[b[i]];
    for(int i=n;i>0;i--){
        ans=(ans+sum(c[i]-1)%mod)%mod;
        add(c[i],1);
    }
    cout<<ans<<endl;
    return 0;
}