#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100005, mod = 10e8 - 3;
struct node{
	ll x;
	int id;
}a[N], b[N];
int c[N], d[N], f[N], f1[N];
ll ans = 0;
int cmp(node a, node b){
	return a.x < b.x;
}
void add(int l, int r)
{
	if(l >= r)
		return;
	int mid = (l + r) / 2;
	add(l, mid);
	add(mid + 1, r);
	int i = l, j = mid + 1, k = l - 1;
    while(i <= mid && j <= r){ 
    	k++;
    	if(f[i] > f[j]){ 
    		f1[k] = f[j];
    		ans += mid - i + 1;
    		ans %= mod;
    		j ++;
		}
		else{
			f1[k] = f[i];
			i ++;
		}
	}
    while(i <= mid){
		k++;
		f1[k]=f[i];
		i++;
	}
    while(j <= r){
		k++;
		f1[k] = f[j];
		j++;
	}
	for(int i = l ; i <= r ; i ++){
	   f[i] = f1[i];
    }
}
int main(){
	ios::sync_with_stdio(false);
	int n;
    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 ++){
		c[a[i].id] = i;
	    d[i] = b[i].id;
	}	
	for(int i = 1 ; i <= n ; i ++){
    	f[i] = d[c[i]];
	}
    add(1, n);
    cout << ans << "\n";
	return 0;
} 

大佬救命

@GoodLuckCat