### BIT ###
class BIT:
    def __init__(self, N):
        self.size = N
        self.arr = [0] * (N+1)

    def add(self, i, x):
        while i <= self.size:
            self.arr[i] += x
            i += i & -i

    def sum(self, i):
        res = 0
        while i:
            res += self.arr[i]
            i -= i & -i
        return res

# 転倒数
def inversion_number(perm):
    sup = max(perm)
    bit = BIT(sup)
    res = 0
    for i, p in enumerate(perm):
        bit.add(p, 1)
        res += i + 1 - bit.sum(p)
    return res


def main():
	N = int(input())
	A = [list(map(int, input().split())) for _ in range(N)]
	
	inv = inversion_number(A)
	print(inv)

main()