#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define ll long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int L, int R) {
return uniform_int_distribution<int>(L, R)(rng);
}
const int N = 100000+5;
int bit[N], a[N];
int n;
void update(int x) {
while (x < N) {
bit[x]++;
x += (x & (-x));
}
}
int get(int x) {
int res = 0;
while (x > 0) {
res += bit[x];
x -= (x & (-x));
}
return res;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int answer = 0;
for (int i = n; i >= 1; i--) {
answer += get(a[i]-1);
update(a[i]);
}
cout << answer << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// int t; cin >> t;
// while (t--) solve();
solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKLy8gI2RlZmluZSBsbCBsb25nIGxvbmcKCm10MTk5Mzcgcm5nKGNocm9ubzo6c3RlYWR5X2Nsb2NrOjpub3coKS50aW1lX3NpbmNlX2Vwb2NoKCkuY291bnQoKSk7CgppbnQgcmFuZChpbnQgTCwgaW50IFIpIHsKICAgIHJldHVybiB1bmlmb3JtX2ludF9kaXN0cmlidXRpb248aW50PihMLCBSKShybmcpOwp9Cgpjb25zdCBpbnQgTiA9IDEwMDAwMCs1OwppbnQgYml0W05dLCBhW05dOwppbnQgbjsgCgp2b2lkIHVwZGF0ZShpbnQgeCkgewogICAgd2hpbGUgKHggPCBOKSB7CiAgICAgICAgYml0W3hdKys7IAogICAgICAgIHggKz0gKHggJiAoLXgpKTsKICAgIH0KfQoKaW50IGdldChpbnQgeCkgewogICAgaW50IHJlcyA9IDA7CiAgICB3aGlsZSAoeCA+IDApIHsKICAgICAgICByZXMgKz0gYml0W3hdOyAKICAgICAgICB4IC09ICh4ICYgKC14KSk7CiAgICB9CiAgICByZXR1cm4gcmVzOwp9Cgp2b2lkIHNvbHZlKCkgewogICAgY2luID4+IG47IAogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSBjaW4gPj4gYVtpXTsKCWludCBhbnN3ZXIgPSAwOyAKCWZvciAoaW50IGkgPSBuOyBpID49IDE7IGktLSkgewoJCWFuc3dlciArPSBnZXQoYVtpXS0xKTsgCgkJdXBkYXRlKGFbaV0pOyAKCX0KCWNvdXQgPDwgYW5zd2VyIDw8ICdcbic7Cn0KCnNpZ25lZCBtYWluKCkgewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKDApOwogICAgLy8gaW50IHQ7IGNpbiA+PiB0OwogICAgLy8gd2hpbGUgKHQtLSkgc29sdmUoKTsKICAgIHNvbHZlKCk7Cn0=