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

D = {}
for i, b in enumerate(B):
    D[b] = i
A = [D[a] for a in A]
#print(A)

# 1-indexed
bit = [0]*(n+1)

def bit_query(i):
    res = 0
    while i > 0:
        res += bit[i]
        i -= i & (-i)
    return res

def bit_update(i, x):
    while i <= n:
        bit[i] += x
        i += i & (-i)

ans = 0
for j in range(n):
    ans += j-bit_query(A[j])
    bit_update(A[j]+1, 1)

print(ans)