N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))


class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s


ind = [-1] * (N + 1)
for i, b in enumerate(B, 1):
    ind[b] = i

bit = Fenwick_Tree(N + 1)
ans = 0
for i, a in enumerate(A):
    id = ind[a]
    ans += i - bit.sum(0, id)
    bit.add(id, 1)


print(ans)