#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

const int MAXN = 1000100;
int A[MAXN];
int N;
int m;
ll L[MAXN], R[MAXN];

int bitl[MAXN+1], bitr[MAXN+1];
ll sum(int i, int *b) {
    ll s = 0;
    while (i > 0) {
        s += b[i];
        i -= i & -i;
    }
    return s;
}

void add(int i, int x, int *b) {
    while (i <= m) {
        b[i] += x;
        i += i & -i;
    }
}

int main(void) {
    cin >> N;
    vector<int> vals;
    for (int i = 0; i < N; i++) {
        scanf("%d", A+i);
        vals.push_back(A[i]);
    }
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    m = vals.size();
    for (int i = 2; i < N; i++) {
        int index = lower_bound(vals.begin(), vals.end(), A[i]) - vals.begin();
        add(index+1, 1, bitr);
    }
    {
        int index = lower_bound(vals.begin(), vals.end(), A[0]) - vals.begin();
        add(index+1, 1, bitl);
    }
    ll ans = 0;
    for (int i = 1; i < N-1; i++) {
        int index = lower_bound(vals.begin(), vals.end(), A[i]) - vals.begin();
        int index2 = lower_bound(vals.begin(), vals.end(), A[i+1]) - vals.begin();
//        cout << i << endl;
//        cout << "bitl" << endl;
//        for (int j = 1; j <= m; j++) {
//            cout << sum(j, bitl) << "  ";
//        }
//        cout << endl;
//        cout << "bitr" << endl;
//        for (int j = 1; j <= m; j++) {
//            cout << sum(j, bitr) << "  ";
//        }
//        cout << endl;
        // 左と右がどちらも真ん中よりも小さい
        ans += sum(index, bitl) * sum(index, bitr);
        // 左と右がどちらも真ん中より大きい
        ans += (sum(m, bitl) - sum(index+1, bitl)) * (sum(m, bitr) - sum(index+1, bitr));
        add(index+1, 1, bitl);
        add(index2+1, -1, bitr);
    }
    ll sum = 0;
    for (int i = 1; i < N; i++) {
        int index = lower_bound(vals.begin(), vals.end(), A[i]) - vals.begin();
        R[index]++;
    }
    {
        int index = lower_bound(vals.begin(), vals.end(), A[0]) - vals.begin();
        L[index]++;
        sum = L[index] * R[index];
    }
    for (int i = 1; i < N-1; i++) {
        int index = lower_bound(vals.begin(), vals.end(), A[i]) - vals.begin();
        ans -= sum - L[index] * R[index];
        ll tmp = L[index] * R[index];
        L[index]++;
        R[index]--;
        ll diff = tmp - (L[index] * R[index]);
        sum -= diff;
    }
    cout << ans << endl;
    return 0;
}