#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

struct BIT{
    int n;
    vector<long long> t;
    BIT(){}
    BIT(int _n):n(_n+1), t(_n+1){}
    void add(int k, long long val){
        k++;
        while(k < n){
            t[k] += val;
            k += (k&-k);
        }
    }
    long long sum(int k){
        ll r = 0;
        while(k > 0){
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    long long sum(int l, int r){
        return sum(r) - sum(l);
    }
};

template<class Val>
vector<Val> compress(vector<Val> &v){
    vector<Val> a = v;
    sort(all(a));
    a.erase(unique(all(a)), a.end());
    each(b, v)b = (int)(lower_bound(all(a), b) - a.begin());
    return a;
}

int N, Q;
vi a;

int main(){
    cin >> N;
    a.resize(N);
    rep(i, N)scanf("%d", &a[i]);

    auto b = compress(a);
    const int M = sz(b);
    vll cnl(M), cnr(M);
    BIT bitl(M), bitr(M);
    
    for(int i = 1; i <= N - 1; ++i){
        cnr[a[i]]++;
        bitr.add(a[i], 1);
    }

    ll ans = 0;

    ll bad = 0;
    for(int i = 1; i <= N - 2; ++i){
        bad -= cnl[a[i - 1]] * cnr[a[i - 1]];
        if(a[i - 1] != a[i])bad -= cnl[a[i]] * cnr[a[i]];

        cnl[a[i - 1]]++;
        cnr[a[i]]--;
        bitl.add(a[i - 1], 1);
        bitr.add(a[i], -1);

        bad += cnl[a[i - 1]] * cnr[a[i - 1]];
        if(a[i - 1] != a[i])bad += cnl[a[i]] * cnr[a[i]];

        ll sum = bitl.sum(0, a[i])*bitr.sum(0, a[i]) + bitl.sum(a[i] + 1, M)*bitr.sum(a[i] + 1, M);
        sum = sum - bad + cnl[a[i]] * cnr[a[i]];

        ans += sum;
    }

    cout << ans << endl;
}