#include<iostream>
#include<algorithm>
using namespace std;

#define int long long
const int MOD = 99999997;
const int MAXN = 100005;
int n, idx[MAXN];
struct node{
    int x, id;
}a[MAXN], b[MAXN];
int sum[MAXN];
bool cmp(node q, node p){
    return q.x < p.x;
}
int lowbit(int x){
    return x & -x;
}
void add(int x, int k){
    while(x <= n){
        sum[x] = (sum[x] + k) % MOD;
        x += lowbit(x); 
    }
}
int query(int x){
    int ans = 0;
    while(x){
        ans = (ans + sum[x]) % MOD;
        x -= lowbit(x);
    }
    return ans;
} 

signed main(){
    freopen("MatchNOIP2013.in", "r", stdin);
    freopen("MatchNOIP2013.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i ++){
        cin >> a[i].x; a[i].id = i;
    }
    for(int i = 1;i <= n;i ++){
        cin >> b[i].x; b[i].id = i;
    }
    sort(a + 1, a + n + 1, cmp);
    sort(b + 1, b + n + 1, cmp);
    for(int i = 1;i <= n;i ++){
        idx[a[i].id] = b[i].id; 
    }
    int cnt = 0;
    for(int i = 1;i <= n;i ++){
        add(idx[i], 1);
        cnt = (cnt + (i - query(idx[i]))) % MOD; 
    }
    cout << cnt << '\n';
    return 0;
}