#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];

struct ST {
    struct Node {
        int l, r;
        ll sum, flag;
    };
    vector<Node> tr;

    ST(ST&& other) noexcept : tr(move(other.tr)) { }
    ST (int l, int r) : tr(vector<Node>(((r - l) << 2) + 10)) { build(1, l, r); }

    ST& operator=(ST&& other) noexcept {
        if (this != &other) {
            tr = move(other.tr);
        }
        return *this;
    }

    void pushup(int u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum; }
    void pushdown(Node& u, Node& l, Node& r) {
        l.flag += u.flag, r.flag += u.flag;
        l.sum += u.flag * (l.r - l.l + 1), r.sum += u.flag * (r.r - r.l + 1);
        u.flag = 0;
    }
    void pushdown(int u) { if (tr[u].flag) pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }

    void build(int u, int l, int r) {
        tr[u] = {l, r};
        if (l == r) return;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }

    ll query(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query(u << 1, l, r);
        if (r > mid) res += query(u << 1 | 1, l, r);
        return res;
    }

    void modify(int u, int l, int r, ll v) {
        if (tr[u].l >= l && tr[u].r <= r) tr[u].flag += v, tr[u].sum += (tr[u].r - tr[u].l + 1) * v;
        else {
            pushdown(u);
            int mid = tr[u].l + tr[u].r >> 1;
            if (l <= mid) modify(u << 1, l, r, v);
            if (r > mid) modify(u << 1 | 1, l, r, v);
            pushup(u);
        }
    }
};

vector<int> num;
int find(int x) { return lower_bound(num.begin(), num.end(), x) - num.begin(); }
void solve() {
    scanf("%d", &n);
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i), num.push_back(w[i]);
    sort(num.begin(), num.end());
    num.erase(unique(num.begin(), num.end()), num.end());
    ST tr(-1, num.size());
    ll res = 0;
    for (int i = 1; i < n + 1; i++) {
        w[i] = find(w[i]);
        res += tr.query(1, w[i] + 1, num.size());
        tr.modify(1, w[i], w[i], 1);
    }
    printf("%lld\n", res);
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}