import bisect

n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a = sorted(a)

ans = 0
for i, x in enumerate(b):
    p = bisect.bisect_right(a, x)
    
    if p < i:
        ans += n - i
    else:
        ans += n - p
print(ans)