import typing

class FenwickTree:
    '''Reference: https://en.wikipedia.org/wiki/Fenwick_tree'''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.data = [0] * n

    def add(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        return self._sum(right) - self._sum(left)

    def _sum(self, r: int) -> typing.Any:
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r

        return s

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = A + B
C = sorted(list(set(C)))
NC = len(C)
dic = dict(zip(C, range(NC)))
A.sort()
ft = FenwickTree(NC)
ans = 0
for i in range(N):
    ft.add(dic[B[i]],1)
    ans += ft.sum(0, dic[A[i]])
print(ans)