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[i:], x)
    ans += n - p - i
    
print(ans)