class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


n = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
id = [-1]*(n+1)
for i,b in enumerate(B):
    id[b] = i

iA = [id[a] for a in A]

bit = BIT(n+5)
ans = 0
for i,a in enumerate(iA):
    s = bit.sum(a)
    ans += i-s
    bit.add(a,1)
print(ans)