#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

template <class T>
struct BIT {
    BIT(int n) : b(n + 1), n(n) {}
    void add(int i, T v) {
        for (int k = i + 1; k <= n; k += k & -k) b[k] += v;
    }
    T sum(int k) {
        T s = 0;
        for (; k > 0; k -= k & -k) s += b[k];
        return s;
    }
    vector<T> b;
    int n;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        int t;
        cin >> t;
        t--;

        a[t] = i;
    }
    for (int i = 0; i < n; i++) {
        int t;
        cin >> t;
        t--;

        b[i] = a[t];
    }

    BIT<int> bt(n);
    ll r = (ll)n * (n - 1) / 2;
    for (int i = 0; i < n; i++) {
        int t = b[i];

        r -= bt.sum(t);
        bt.add(t, 1);
    }

    cout << r << endl;

    return 0;
}