def count_inversion(sequence):
    return sum(sum(m<n for m in sequence[i+1:]) for i,n in enumerate(sequence))

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
l = []
for i in range(N):
    for j in range(N):
        if A[i] == B[j]:
            l.append(j)
ans = count_inversion(l)
print(ans)