class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = len(self.data) - 1

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

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def range_sum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s

    def suffix_sum(self, l: int) -> int:
        """区間 l... の和"""
        return self.range_sum(l, self.n-1)


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

d = {}
for i, a in enumerate(A):
    d[a] = i

ft = FenwickTree(N+10)
for i in range(N):
    ft.add(i, 1)

ans = 0
for i in reversed(range(N)):
    b = B[i]
    p = d[b]
    ans += ft.suffix_sum(p+1)
    ft.add(p, -1)

print(ans)