from bisect import bisect_left
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))

A.sort()
que = []
count,k = 0,0
minB = B[0]

for i in range(N):
    j = bisect_left(que,B[i])
    que.insert(j,B[i])
    minB = min(B[i],minB)
    if A[k] > minB:
        count += bisect_left(que,A[k])
    k += 1

print(count)