from collections import defaultdict
def inversion(A):
    BIT=[0 for _ in range(N+1)]
    def BIT_add(x,w):
        while x<=N:
            BIT[x]+=w
            x+=(x&-x)
    def BIT_sum(x):
        ret=0
        while x>0:
            ret+=BIT[x]
            x-=(x&-x)
        return ret
    inv=0
    for a in reversed(A):
        inv+=BIT_sum(a+1)
        BIT_add(a+1,1)
    return inv
N=int(input())
A=list(map(lambda x:int(x)-1,input().split()))
D=defaultdict(int)
for a in A:
    D[a]+=1
ans=inversion(A)
for v in D.values():
    ans-=v-1
print(ans)