# LayCurseさん想定解 http://yukicoder.me/submissions/8162 の写経
class BIT:
    def __init__(self,n):self.n=n;self.buf=[0]*n
    def add(self,x,v):
        while x<self.n:self.buf[x]+=v;x|=x+1
    def sum(self,x):
        s=0
        while x>=0:s+=self.buf[x];x=(x&(x+1))-1
        return s
    def range(self,a,b):return self.sum(b if b>=0 else self.n)-self.sum(a-1)
N=input()
tmp=sorted(zip(map(int,raw_input().split()),range(N)))
A=[i for i,j in tmp]
ind=[j for i,j in tmp]
t=BIT(N)
res=0
st=0
while st<N:
    arr=[ind[st]]
    sz=1
    while((st+1<N)and(A[st]==A[st+1])):st+=1;arr.append(ind[st])
    sz=len(arr)
    for i in range(sz):
        x=t.sum(arr[i]-1)
        y=t.range(arr[i]+1,N-1) if arr[i]+1<N else 0
        res+=x*y+(arr[i]-x-i)*(N-arr[i]-1-y-(sz-i-1))
    for i in range(sz):t.add(arr[i],1)
    for i in range(1,sz):res-=(arr[i]-arr[i-1]-1)*i*(sz-i)
    st+=1
print res