N = int(input())
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]

Bidx = [0]*(N+1)
for i in range(N):
    Bidx[B[i]] = i

for i in range(N):
    B[Bidx[A[i]]] = i+1

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

num = 1
while num <= N:
    num *= 2

bit = Bit(num)
ans = 0

for i, p in enumerate(B):
    bit.add(p, 1)
    ans += i + 1 - bit.sum(p)

print(ans)