N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = [0]+sorted(list(set(A+B)))
D = {C[i]:i for i in range(len(C))}
A1 = sorted([D[A[i]] for i in range(N)])
B1 = [D[B[i]] for i in range(N)]
K = 0
while 2**K<len(D):
    K += 1
M = 2**K
T = [0]*(M+1)
def update(i,x):
    while i<=M:
        T[i] += x
        i += i&(-i)
def cumsum(i):
    tot = 0
    while i>0:
        tot += T[i]
        i -= i&(-i)
    return tot
ans = 0
for i in range(N):
    update(B1[i],1)
    ans += cumsum(A1[i]-1)
print(ans)