#include <iostream>
#include <map>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
#include <fstream>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
int segment_tree[3 * maxn];
void build_tree(int L, int R, int pos) {
    if(L == R) {
        segment_tree[pos] = 0;
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * pos);
        build_tree(middle + 1, R, 2 * pos + 1);
        segment_tree[pos] = segment_tree[2 * pos] + segment_tree[2 * pos + 1];
    }
}
int query(int L, int R, int pos, int i, int j) {
    // L R i L R j L R
    if(i <= L and R <= j) {
        return segment_tree[pos];
    }
    if(R < i or j < L) {
        return 0;
    }
    int middle = (L + R) / 2;
    return query(L, middle, 2 * pos, i, j) + query(middle + 1, R, 2 * pos + 1, i, j);
}
void update(int L, int R, int pos, int new_idx) {
    if(L == R) {
        segment_tree[pos] = 1;
        return;
    }
    int middle = (L + R) / 2;
    if(new_idx <= middle) {
        update(L, middle, 2 * pos, new_idx);
    }
    else {
        update(middle + 1, R, 2 * pos + 1, new_idx);
    }
    segment_tree[pos] = segment_tree[2 * pos] + segment_tree[2 * pos + 1];
}
int main() {
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    build_tree(0, n, 1);
    ll result = 0;
    
    for(int i = n - 1; i >= 0; i--) {
        update(0, n, 1, v[i]);
        result += query(0, n, 1, 0, v[i] - 1);
    }
    cout << result << endl;
    return 0;
}
/*
 M..
 ###
 ..V
 **/