#include<cstdio>
#include<cmath>
int order[100005];
int a[100005], b[100005];
int c[100005];

void change(int p,int v,int n){
    while(p<=n){
        c[p] += v;
        p += p&-p;
    }
}

int ask(int p){
    int res = 0;
    while(p!=0){
        res += c[p];
        p -= p&-p;
    }
    return res;
}

int main(){
    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
    for(int i = 1; i <= n; i++){
        scanf("%d",&b[i]);
        order[b[i]] = i;
    }
    long long ans = 0;
    for(int i = n; i >= 1; i--){
        int u = order[a[i]];
        //printf("i = %d, u = %d\n",i,u);
        ans += (long long)ask(u-1);
        change(u,1,n);
    }
    printf("%lld\n",ans);
    return 0;
}