#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__

class BIT
{
    private:
        vi node;
        int n;
    public:
        BIT(int n_) {
            n = n_;
            node.resize(n + 1);
        }

        void add(int i, int x) {
            while (i <= n) {
                node[i] += x;
                i += (i & (-i));
            }
        }

        int sum(int i) {
            int sum = 0;
            while (i > 0) {
                sum += node[i];
                i -= (i & (-i));
            }
            return sum;
        }

        int sum(int a, int b) {
            return sum(b) - sum(a - 1);
        }
};

int main() {
    int N;
    cin >> N;
    vi A(N + 1), B(N + 1);
    rep(i, N) {
        cin >> A[i];
    }
    rep(i, N) {
        cin >> B[i];
    }

    vi conv(N + 1);
    rep(i, N) {
        conv[B[i]] = i + 1;
    }
    rep(i, N) {
        A[i] = conv[A[i]];
    }

    int cnt = 0;
    BIT bit(N);
    rep(i, N) {
        bit.add(A[i], 1);
        cnt += (i + 1) - bit.sum(A[i]);
    }

    cout << cnt << endl;
}