class BIT:
    def __init__(self, n):
        self.n = n
        self.data = [0]*(n+1)
 
    def to_sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= (i & -i)
        return s
 
    def add(self, i, x):
        while i <= self.n:
            self.data[i] += x
            i += (i & -i)
 
    def get(self, i, j):
        return self.to_sum(j)-self.to_sum(i-1)

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = []
for i in range(N):
  C.append((A[i],"A",i))
  C.append((B[i],"B",i))
C.sort()
AA = [-1 for _ in range(N)]; BB = [-1 for _ in range(N)]
cnt = 0
prev = 0
for i in range(2*N):
  ID = C[i][2]
  if C[i][0] != prev:
    cnt += 1
  prev = C[i][0]
  if C[i][1] == "A":
    AA[ID] = cnt
  else:
    BB[ID] = cnt
#print(AA)
#print(BB)
AA.sort()
Tree = BIT(2*N)
ans = 0
for i in range(N):
  Tree.add(BB[i],1)
  if AA[i] > 1:
    ans += Tree.get(1,AA[i]-1)
print(ans)