#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
using namespace std;
class BIT{
  /*binary indexed tree*/
 private:
  vector<long long> data;
  int size;
 public:
  BIT(int n): data(n+1,0),size(n){
    return;
  }
  long long sum(int l, int r ){
    // return sum in [l+1,r] or (l,r]
    return sum_(r)-sum_(l);
  }
  long long sum_(int i){
    // return sum (0, i]
    long long ans = 0;
    while( 0 < i ){
      ans += data[i];
      i -= i&-i;   // 11010110 -> 1010100
    }
    return ans;
  }
  void add(int i, int x){
    // add x to i
    while( i <= size ){
      data[i] += x;
      i+= i&-i;
    }
    return;
  }
};


int main(){
  int N;
  cin >> N;
  vector<int> A(N,0);
  for( int i = 0; i<N; i++) cin>> A[i];
  vector<int> V=A;
  sort(V.begin(),V.end());
  V.erase(unique(V.begin(),V.end()),V.end());
  map<int,int> unZip;
  int Vsize=V.size();
  for( int i = 0 ; i<(int)V.size(); i++){
   unZip[V[i]]=i+1;
  }
  BIT left(Vsize);
  BIT right(Vsize);
  vector<int> sameArray[Vsize+1];
  for( int i = 0 ; i < N; i++){
   right.add(unZip[A[i]],1);
   sameArray[unZip[A[i]]].push_back(i);
  }
  long long ans = 0;
  for( int i = 0 ; i <N-1 ; i++){
   right.add(unZip[A[i]],-1);
   ans += left.sum_(unZip[A[i]]-1)*right.sum_(unZip[A[i]]-1);
   ans += left.sum(unZip[A[i]],Vsize)*right.sum(unZip[A[i]],Vsize);
   //cout << ans << endl;
   left.add(unZip[A[i]],1);
  }
  for( int i = 0 ; i <= Vsize; i++){
    for( int j = 0 ; j+1 < (int)sameArray[i].size(); j++ ){
      long long l=j+1;
      long long r = (int)sameArray[i].size()-l;
      ans-= l*r*(sameArray[i][j+1]-sameArray[i][j]-1);
    }
  }
  cout << ans << endl;
  return 0;
}