N = int(input())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
d = {}
#対応付ける
for i in range(1,N+1):
    d[A[i-1]]=i
C = []
for i in range(N):
    C.append(d[B[i]])

# BIT
data = [0]*(N+1)
def add(k, x):
    while k <= N:
      data[k] += x
      k += k & -k
def get(k):
    s = 0
    while k:
        s += data[k]
        k -= k & -k
    return s

ans = 0
for i, a in enumerate(C):
    # 自分より小さい要素がいくつ存在するかを計算
    ans += (N-1-i) - get(a)
    add(a, 1)
print(ans)