#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int INF = 1e9;
const ll LINF = 1e18;
const int N = 6e4 + 5;
const int MAX_A = 6e4 + 5;
int n;
int a[N], ft[MAX_A];
void update(int i, int val) {
for (; i > 0; i -= i & (-i)) ft[i] += val;
}
int get(int i) {
int ans = 0;
for (; i < MAX_A; i += i & (-i)) ans += ft[i];
return ans;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
ll ans = 0;
// for (int i = 1; i <= n; i++) {
// int cnt = 0;
// for (int j = i - 1; j >= 1; j--) {
// if (a[j] > a[i]) cnt++;
// }
// ans += cnt;
// }
for (int i = 1; i <= n; i++) {
// đếm bao nhiêu thằng j < i mà a[j] thuộc đoạn [a[i] + 1, MAX_A - 1]
int cnt = get(a[i] + 1);
ans += cnt;
update(a[i], 1);
}
cout << ans << '\n';
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+IAp1c2luZyBuYW1lc3BhY2Ugc3RkOyAgCgp0eXBlZGVmIGxvbmcgbG9uZyBsbDsgIAp0eXBlZGVmIHBhaXI8aW50LCBpbnQ+IGlpOyAgCgpjb25zdCBpbnQgSU5GID0gMWU5OyAgCmNvbnN0IGxsIExJTkYgPSAxZTE4OyAgCgpjb25zdCBpbnQgTiA9IDZlNCArIDU7IApjb25zdCBpbnQgTUFYX0EgPSA2ZTQgKyA1OyAKCmludCBuOyAgCmludCBhW05dLCBmdFtNQVhfQV07IAoKdm9pZCB1cGRhdGUoaW50IGksIGludCB2YWwpIHsKCWZvciAoOyBpID4gMDsgaSAtPSBpICYgKC1pKSkgZnRbaV0gKz0gdmFsOyAgCn0KCmludCBnZXQoaW50IGkpIHsKCWludCBhbnMgPSAwOyAgIAoJZm9yICg7IGkgPCBNQVhfQTsgaSArPSBpICYgKC1pKSkgYW5zICs9IGZ0W2ldOyAgCglyZXR1cm4gYW5zOyAgCn0KCmludCBtYWluKCkgewoJaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7ICAJCgljaW4gPj4gbjsgIAoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSBjaW4gPj4gYVtpXTsgCgoJbGwgYW5zID0gMDsgIAoJLy8gZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSB7CgkvLyAJaW50IGNudCA9IDA7ICAgCgkvLyAJZm9yIChpbnQgaiA9IGkgLSAxOyBqID49IDE7IGotLSkgewoJLy8gCQlpZiAoYVtqXSA+IGFbaV0pIGNudCsrOyAKCS8vIAl9CgkvLyAJYW5zICs9IGNudDsgIAoJLy8gfQoJCglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKCQkvLyDEkeG6v20gYmFvIG5oacOqdSB0aOG6sW5nIGogPCBpIG3DoCBhW2pdIHRodeG7mWMgxJFv4bqhbiBbYVtpXSArIDEsIE1BWF9BIC0gMV0KCQlpbnQgY250ID0gZ2V0KGFbaV0gKyAxKTsgCgkJYW5zICs9IGNudDsgICAKCQl1cGRhdGUoYVtpXSwgMSk7IAoJfQoKCWNvdXQgPDwgYW5zIDw8ICdcbic7IAp9Cg==