# -*- coding: utf-8 -*-

N = int(input())
A = {int(x):i for i,x in enumerate(input().split())}
B = list(map(int, input().split()))

def argsort(seq):
    return sorted(range(len(seq)), key=seq.__getitem__)

class BIT:
    def __init__(self, n):
        self.n = n
        self.data = [0]*(n+1)
        self.el = [0]*(n+1)
        self.depth = n.bit_length()
        
    def sum(self, i):
        """ iまでの和"""
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s
    
    def add(self, i, x):
        """assert i > 0"""
        self.el[i] += x
        while i <= self.n:
            self.data[i] += x
            i += i & -i
            
    def get(self, i, j=None):
        """iだけならその値、i,jならsum(j)-sum(i)"""
        if j is None:
            return self.el[i]
        return self.sum(j) - self.sum(i)
    
    def lower_bound(self, x):
        """ 累積和がx以上になる最小のindexと、その直前までの累積和 """
        sum_ = 0
        pos = 0
        for i in range(self.depth, -1, -1):
            k = pos + (1 << i)
            if k <= self.n and sum_ + self.data[k] < x:
                sum_ += self.data[k]
                pos += 1 << i
        return pos + 1, sum_


bit = BIT(10**5+10)
ans = 0
for i in B:
    bit.add(A[i]+1, 1)
    ans += bit.get(A[i]+1, 10**5+10)
print(ans)