class BinaryIndexTree:  # 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 = list(map(int, input().split()))
B = list(map(int, input().split()))
btoi = {b: i for i, b in enumerate(B, 1)}

ans = 0
bit = BinaryIndexTree(N + 1)

for i, a in enumerate(A):
    ans += i - bit.sum(btoi[a])
    bit.add(btoi[a], 1)
print(ans)