class BinaryIndexedTree():  #1-indexed
    def __init__(self, n):
        self.n = n
        self.tree = [0 for _ in range(n + 1)]

    def sum(self, idx):
        res = 0
        while idx:
            res += self.tree[idx]
            idx -= idx & -idx
        return res

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

    def bisect_left(self, x):
        if x <= 0: return 0
        res, tmp = 0, 2**((self.n).bit_length() - 1)
        while tmp:
            if res + tmp <= self.n and self.tree[res + tmp] < x:
                x -= self.tree[res + tmp]
                res += tmp
            tmp >>= 1
        return res + 1

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

ind = [None for _ in range(N)]

for i in range(N):
    ind[A[i] - 1] = i + 1

C = [None for _ in range(N)]

for i in range(N):
    C[i] = ind[B[i] - 1]

bit = BinaryIndexedTree(N)
res = 0

for i in range(N):
    bit.add(C[i], 1)
    res += i + 1 - bit.sum(C[i])

print(res)