#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

#include <atcoder/fenwicktree>
using namespace atcoder;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N;
    cin >> N;
    vector<int> A(N), label(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) {
        int B;
        cin >> B;
        label[B - 1] = i;
    }
    rep(i, 0, N) A[i] = label[A[i] - 1];
    
    fenwick_tree<ll> BIT(N);
    ll ans = 0;
    rep(i, 0, N) {
        ans += BIT.sum(A[i], N);
        BIT.add(A[i], 1);
    }
    
    cout << ans << '\n';
}