#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define PI 3.1415926536

#define SIZE 1000002

/* BIT(1-index) */
struct BIT{
    ll BIT_n;

    ll data[SIZE+1];
    
    BIT(int n){
        memset(data,0,sizeof(data));
        BIT_n = n;
    }
    
    void add(int k,ll x){
        while(k<=BIT_n){
            data[k]+=x;
            k+= k&(-k);
        }
    }

    ll query(int k){
        ll rec=0;
        
        while(k>0){
            rec+=data[k];
            k-= k&(-k);
        }
        
        return rec;
    }
};

int n,a[SIZE],s_a[SIZE],dic_size,d;
ll xa,xb,xc=0,ya,yb,yc=0;
ll s1[SIZE],s2[SIZE],s3[SIZE];
ll sum3=0;
ll ans=0;
map<int,int> dic;
BIT bit1(SIZE),bit2(SIZE),bit3(SIZE);

int main(){
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
        s_a[i]= a[i];
    }
    
    sort(s_a,s_a+n);
    
    int* end = unique(s_a,s_a+n);
    
    dic_size = (int)(end-s_a);
    
    for(int i=0;i<dic_size;i++){
        dic[s_a[i]] = i+1;
    }
    
    for(int i=0;i<n;i++){
        d = dic[a[i]];
        s1[d]++;
    }
    
    for(int i=1;i<=dic_size;i++){
        bit1.add(i,s1[i]);
    }
    
    for(int i=0;i<n;i++){
        d = dic[a[i]];
        
        xa = bit1.query(d-1);
        xb = bit2.query(d-1);
        xc = bit3.query(d-1);
        ya = (n-i)-xa-s1[d];
        yb = i-xb-s2[d];
        yc = sum3-xc-s3[d];
        
        ans += xa*xb-xc;
        ans += ya*yb-yc;
        
        s1[d]--;
        s2[d]++;
        bit1.add(d,-1);
        bit2.add(d,1);
        bit3.add(d,s1[d]*s2[d]-s3[d]);
        sum3+=s1[d]*s2[d]-s3[d];
        s3[d]=s1[d]*s2[d];

        //seg3.s(d,s3[d]);
    }
    
    printf("%lld\n",ans);
    
    return 0;
}