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