#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

class BinaryIndexedTree
{
    int n;
    vector<int> data;
public:
    BinaryIndexedTree(int n){ // コンストラクタ
        this->n = n;
        data.assign(n+1, 0);
    }
    void add(int k, int x){ // k番目の要素にxを加算する
        ++ k;
        while(k <= n){
            data[k] += x;
            k += k & -k;
        }
    }
    int sum(int k){ // 区間[0,k]の総和を返す
        ++ k;
        int ret = 0;
        while(k > 0){
            ret += data[k];
            k -= k & -k;
        }
        return ret;
    }
    int sum(int a, int b){ // 区間[a,b]の総和を返す
        return sum(b) - sum(a-1);
    }
};

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> index;
    for(int i=0; i<n; ++i){
        cin >> a[i];
        index[a[i]];
    }

    int m = 0;
    for(auto& p : index){
        p.second = m;
        ++ m;
    }
    for(int i=0; i<n; ++i)
        a[i] = index[a[i]];

    BinaryIndexedTree left(m), right(m);
    for(int i=0; i<n; ++i)
        right.add(a[i], 1);

    long long same = 0;
    long long ret = 0;
    for(int i=0; i<n; ++i){
        right.add(a[i], -1);
        same -= left.sum(a[i], a[i]);

        ret += (long long)left.sum(0, a[i] - 1) * right.sum(0, a[i] - 1) +
               (long long)left.sum(a[i] + 1, m - 1) * right.sum(a[i] + 1, m - 1) +
               (long long)left.sum(a[i], a[i]) * right.sum(a[i], a[i]) - same;

        left.add(a[i], 1);
        same += right.sum(a[i], a[i]);
    }
    cout << ret << endl;

    return 0;
}