N = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
s = set(a + b)
rD = sorted(s)
D = {v:i for i,v in enumerate(rD)}
n = len(D)
bit = [0] * (n+1)
def update(i,x):
    while i <= n:
        bit[i] += x
        i += i & -i
def fold(i):
    ans = 0
    while i > 0:
        ans += bit[i]
        i -= i & -i
    return ans
ans = 0
a.sort()
for i in range(N):
    update(D[b[i]]+1,1)
    ans += fold(D[a[i]])
print(ans)