import bisect as B
n=int(input());a=sorted(list(map(int,input().split())));b=list(map(int, input().split()))
A=0
for i in range(n):A+=n-max(i,B.bisect_right(a, b[i]))
print(A)