class Bit:
    """1-indexed"""

    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


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

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

b = Bit(N)
ans = 0
for i, x in enumerate(X):
    ans += i - b.sum(x)
    b.add(x, 1)
print(ans)