import sequtils,strutils,math,algorithm
type
    binaryIndexTree[I:static[int]] = array[I + 1,int]

proc add(BIT :var binaryIndexTree,i : int, a : int)=
    var index = i
    while BIT[0] >= index:
        BIT[index] += a
        index += ((index xor (index - 1)) and index)

proc sum(BIT : binaryIndexTree, i : int):int =
    var index = i
    while index > 0:
        result += BIT[index]
        index = (index and (index - 1))



proc scanf(frmt: cstring) {.varargs, importc,
    header: "<stdio.h>".}

type
    item = tuple[index, size : int]

var
    N = stdin.readline.parseInt
    T : array[1000_001, int]
    A = newSeq[item](N)
    
for n in 0..<N:
    scanf("%d",addr T[n])
    A[n] = (n, T[n])
    
A = A.sortedByIt(it.size)

var i : int = 1
for j, a in A:
    if j == 0:
        T[a.index] = i
    elif a.size == A[j - 1].size:
        T[a.index] = i
    else:
        i += 1
        T[a.index] = i

var
    BIT,SBIT : binaryIndexTree[1_000_001]
    Sr,Sl,S : array[1_000_001,int]

BIT[0] = 1_000_001
SBIT[0] = 1_000_001

var ans : int

for n in 0..<N:
    var t = T[n]
    Sr[t] += 1
    S[t] += 1
    
for j in 1..i:
    S[j] += S[j - 1]

for n in 0..<N:
    var t = T[n]
    SBIT.add(t, Sr[t] - Sl[t] - 1)
    Sr[t] -= 1
    Sl[t] += 1
    if t > 0:
        ans += BIT.sum(t - 1) * (S[t - 1] - BIT.sum(t - 1))
        ans -= SBIT.sum(t - 1)
    if t < i:
        ans += (BIT.sum(i) - BIT.sum(t)) * (S[i] - S[t] - BIT.sum(i) + BIT.sum(t))
        ans -= (SBIT.sum(i) - SBIT.sum(t))
    BIT.add(t, 1)

echo ans