BIT=[]
siz=0
def BITinit(x):
  global BIT
  global siz
  siz=x
  BIT=[0]*(x+1)

def BITadd(x,a):
  global BIT
  global siz
  z=a
  while(z<=siz):
    BIT[z]+=x
    z+=(z&(-z))

def BITsum(a):
  r=0
  z=a
  while(z>0):
    r+=BIT[z]
    z-=(z&(-z))
  return r

def BITsecsum(a,b):
  return BITsum(max(a,b))-BITsum(min(a,b)-1)

N=int(input())
BITinit(N+1)
A=list(map(int,input().split()))
B=list(map(int,input().split()))
D=dict()
for i in range(N):
  D[B[i]]=i+1
C=[D[A[i]] for i in range(N)]
P=0
for i in range(N):
  P+=i-BITsum(C[i])
  BITadd(1,C[i])
print(P)