#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 99999997;
struct BIT
{
    vector<int> bit;
    int n;
    BIT(int _n) : n(_n) {
        bit.resize(_n + 1, 0);
    }
    int lowbit(int x) {
        return x & (-x);
    }
    void add(int x, int y) {
        while (x <= n) {
            bit[x] = (bit[x] + y) % mod;
            x += lowbit(x);
        }
    }
    int query(int x) {
        int ans = 0;
        while (x) {
            ans = (ans + bit[x]) % mod;
            x -= lowbit(x);
        }
        return ans;
    }
};
signed main()
{
    freopen("MatchNOIP2013.in", "r", stdin);
    freopen("MatchNOIP2013.out", "w", stdout);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n), b(n);
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        a[i].second = i;
        cin >> a[i].first;
    }
    for (int i = 0; i < n; i++) {
        b[i].second = i;
        cin >> b[i].first;
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (int i = 0; i < n; i++) {
        v[a[i].second] = b[i].second + 1; 
    }
    BIT bit(n);
    int ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        ans = (ans + bit.query(v[i] - 1)) % mod;
        bit.add(v[i], 1);
    }
    cout << ans;
    return 0;
}