#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

struct SEG{
    
    int segn2,seg[2<<20];
    
    void init(int n){
        segn2=1;
        while(segn2<n) segn2*=2;
        
        memset(seg,0,sizeof(seg)*segn2*2);
        /*
        for(int i=0;i<segn2*2-1;i++)
            seg[i]=0;
         */
    }
    
    int q(int a,int b,int l=0,int r=-1,int k=0){
        
        if(r==-1) r+=segn2;
        
        if(a<=l && r<=b) return seg[k];
        if(r<a || b<l) return 0;
        
        return q(a,b,l,(l+r)/2,k*2+1)+q(a,b,(l+r)/2+1,r,k*2+2);
    }
    
    void s(int k,int x){
        k+=segn2-1;
        seg[k]=x;
        
        while(k>0){
            k=(k-1)/2;
            seg[k]=seg[k*2+1]+seg[k*2+2];
        }
        
        return;
    }
    
    void add(int k,int x){
        k+=segn2-1;
        seg[k]+=x;
        
        while(k>0){
            k=(k-1)/2;
            seg[k]=seg[k*2+1]+seg[k*2+2];
        }
        
        return;
    }
};

SEG seg1,seg2,seg3;

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

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);
    
    //cerr << dic_size << endl;
    
    for(int i=0;i<dic_size;i++){
        dic[s_a[i]] = i+1;
    }
    
    seg1.init(dic_size+2);
    seg2.init(dic_size+2);
    //seg3.init(dic_size+2);
    
    for(int i=0;i<n;i++){
        d = dic[a[i]];
        seg1.add(d,1);
        s1[d]++;
    }
    
    for(int i=1;i<=dic_size;i++){
        seg1.add(d,1);
    }
    
    for(int i=0;i<n;i++){
        d = dic[a[i]];
        
        xa = seg1.q(0,d-1);
        xb = seg2.q(0,d-1);
        //xc = seg3.q(0,d-1);
        ya = n-xa-s1[d]; //seg1.q(d+1,dic_size+1);
        yb = n-yb-s2[d]; //seg2.q(d+1,dic_size+1);
        //yc = seg3.q(d+1,dic_size+1);
        
        ans += (ll)xa*xb-xc;
        ans += (ll)ya*yb-yc;
        
        s1[d]--;
        s2[d]++;
        //s3[d]=s1[d]*s2[d];
        seg1.s(d,s1[d]);
        seg2.s(d,s2[d]);
        //seg3.s(d,s3[d]);
    }
    
    printf("%lld\n",ans);
    
    return 0;
}