def countOvertakes(s,f):
count = 0
for i in range(0,len(s)):
if s[i] != f[i]:
where = s.index(f[i])
for j in range(where,i,-1):
[s[j], s[j-1]] = [s[j-1],s[j]]
count += 1
return count
while True:
try:
input()
starting_grid = [int(num) for num in input().split()]
finishing_grid = [int(num) for num in input().split()]
print(countOvertakes(starting_grid,finishing_grid))
except EOFError:
exit()