#【転倒数】

class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
  
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
  
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

def inversion_number(li):
    #para li:list
    #list内部の要素は正であることが必要らしい
    #return : 転倒数
    bit = Bit(max(li))
    res = 0
    for i, l in enumerate(li):
        bit.add(l, 1)
        res += i + 1 - bit.sum(l)
    return res


n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

bi = dict()
for i in range(n):
    bi[b[i]]=i
c = [bi[a[i]]+1 for i in range(n)]

print(inversion_number(c))