#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

struct BIT {
    int N;
    vector<int> V;
    void init(int n) {
        N = 1; while (N < n) N *= 2;
        V.resize(N);
    }
    void add(int p, int v) {
        p++;
        while (p <= N) {
            V[p - 1] += v;
            p += p & -p;
        }
    }
    int sum(int r) {
        int ans = 0;
        while (r >= 1) {
            ans += V[r - 1];
            r -= r & -r;
        }
        return ans;
    }
};

int N;
int A[100000];
int B[100000];

int main() {
    cin >> N;
    rep(i, N) { int a; cin >> a; a--; A[a] = i; }
    rep(i, N) { int b; cin >> b; b--; B[i] = A[b]; }

    BIT G; G.init(N);
    LL ans = 0;
    rep(i, N) {
        ans += i - G.sum(B[i]);
        G.add(B[i], 1);
    }
    cout << ans << endl;

    return 0;
}