import bisect

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.sort()

ans1 = []
ans2 = []
result = 0
for i in range(n):
    result += bisect.bisect_left(ans1, A[i])
    ans2.append(B[i])
    ans2.sort()
    result += bisect.bisect_left(ans2, A[i])
    if len(ans2) == 300:
        ans1.extend(ans2)
        ans1.sort()
        ans2.clear()
        
print(result)