#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>


//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

int n;
vector<int> a, t, dif, last;
map<int, int> ind;

void update(int v, int l, int r, int pos) {
    if (r - l == 1) {
        t[v] = 1;
        return;
    }
    int m = (l + r) / 2;
    if (pos < m) {
        update(2 * v + 1, l, m, pos);
    } else {
        update(2 * v + 2, m, r, pos);
    }
    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

int sum(int v, int l, int r, int askl) {
    if (r <= askl) {
        return 0;
    }
    if (l >= askl) {
        return t[v];
    }
    int m = (l + r) / 2;
    return sum(2 * v + 1, l, m, askl) + sum(2 * v + 2, m, r, askl);
}

vector<int> t1;

void update1(int v, int l, int r, int pos, int val) {
    if (r - l == 1) {
        t1[v] = val;
        return;
    }
    int m = (l + r) / 2;
    if (pos < m) {
        update1(2 * v + 1, l, m, pos, val);
    } else {
        update1(2 * v + 2, m, r, pos, val);
    }
    t1[v] = t1[2 * v + 1] + t1[2 * v + 2];
}

int get_sum(int v, int l, int r, int askl) {
    if (r <= askl) {
        return 0;
    }
    if (l >= askl) {
        return t1[v];
    }
    int m = (l + r) / 2;
    return get_sum(2 * v + 1, l, m, askl) + get_sum(2 * v + 2, m, r, askl);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    a.resize(n);
    for (auto &k : a) cin >> k;
    t.resize(4 * n);
    dif.assign(n, 0);
    last.assign(n, 0);
    t1.assign(4 * n, 0);
    vector<int> b = a;
    sort(all(b));
    for (int i = 0; i < n; i++) {
        ind[b[i]] = i;
    }
    int ans = 0, x;
    for (int i = 0; i < n; i++) {
        last[ind[a[i]]] = sum(0, 0, n, ind[a[i]]);
        x = get_sum(0, 0, n, ind[a[i]]);
        ans += x;
        update1(0, 0, n, ind[a[i]], last[ind[a[i]]]);
        update(0, 0, n, ind[a[i]]);
    }
//    for (auto k : last) cout << k << " ";
//    cout << "\n";
    cout << ans;

}
/*
 3
 3 2 1
 -> 1

 3
 2 3 1
 -> 0

 4
 10 8 3 1
 -> 4

 4
 1 5 4 3
 -> 1
*/