#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

long long a[],b[],d[],sum,d1[];

long long S1[],S2[],S11[],S21[];

map<long long,long long>id;

inline void add(long long le,long long ri,long long wh,long long pl,long long k){

    d[wh]+=k;

    if(le==ri)return;

    long long mid=(le+ri)>>;

    if(mid>=pl)add(le,mid,wh<<,pl,k);

      else add(mid+,ri,wh<<|,pl,k);

    return;

}

inline void add2(long long le,long long ri,long long wh,long long pl,long long k){

    d1[wh]+=k;

    if(le==ri)return;

    long long mid=(le+ri)>>;

    if(mid>=pl)add2(le,mid,wh<<,pl,k);

      else add2(mid+,ri,wh<<|,pl,k);

    return;

}

inline long long q(long long le,long long ri,long long x,long long y,long long wh){

    if(x>y)return ;

    if(le>=x&&ri<=y)return d[wh];

    long long mid=(le+ri)>>,ans=;

    if(mid>=x)ans+=q(le,mid,x,y,wh<<);

    if(mid<y)ans+=q(mid+,ri,x,y,wh<<|);

    return ans;

}

inline long long q2(long long le,long long ri,long long x,long long y,long long wh){

    if(x>y)return ;

    if(le>=x&&ri<=y)return d1[wh];

    long long mid=(le+ri)>>,ans=;

    if(mid>=x)ans+=q2(le,mid,x,y,wh<<);

    if(mid<y)ans+=q2(mid+,ri,x,y,wh<<|);

    return ans;

}

int main(){

    long long n,m,i,j,k,sum1=,sum2=;

    scanf("%lld",&n);

    id.clear();

    for(i=;i<=n;i++)scanf("%lld",&a[i]),b[i]=a[i];

    sort(b+,b+n+);

    for(i=;i<=n;i++)

      if(!id[b[i]])

        id[b[i]]=++sum;

    for(i=;i<=n;i++){

      long long x=q(,sum,,id[a[i]]-,),y=q(,sum,id[a[i]]+,sum,);

      sum1+=x;sum2+=y;

      add(,sum,,id[a[i]],);

    }

    long long Ans=(long long)sum1*sum2;

    memset(d,,sizeof(d));

    memset(d1,,sizeof(d1));

    for(i=;i<=n;i++){

      S1[i]=q(,sum,,id[a[i]]-,);

      S11[i]=q(,sum,id[a[i]]+,sum,);

      add(,sum,,id[a[i]],);

    }

    for(i=n;i>;i--){

      S2[i]=q2(,sum,,id[a[i]]-,);

      S21[i]=q2(,sum,id[a[i]]+,sum,);

      add2(,sum,,id[a[i]],);

    }

    for(i=;i<=n;i++)

      Ans-=(long long)S1[i]*S2[i]+(long long)S11[i]*S1[i]+(long long)S21[i]*S2[i]+(long long)S21[i]*S11[i];

    printf("%lld\n",Ans);

    return ;

}