class Bit:
    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()))
d = {}
for i in range(N):
    d[B[i]]=i+1
for i in range(N):
    A[i] = d[A[i]]

bit = Bit(N+1)
ans = 0
for i in range(N):
    A[i]+=1

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