#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0,bit[100005];
pair <int,int> p[100005];
void UPDATE(int i, int v)
{
while (i<=n) bit[i]+=v,i+=i&(-i);
return;
}
int GET(int l, int r)
{
l--;
int resl=0,resr=0;
while (l>0) resl+=bit[l],l-=l&(-l);
while (r>0) resr+=bit[r],r-=r&(-r);
return resr-resl;
}
signed main()
{
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n;
for (int i=1;i<=n;i++) cin>>p[i].first,p[i].second=i;
sort(p+1,p+n+1,greater<pair<int,int>>());
for (int i=1;i<=n;i++)
{
UPDATE(p[i].second,1);
ans+=GET(1,p[i].second-1);
}
cout<<ans<<'\n';
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgaW50IGxvbmcgbG9uZwp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbixhbnM9MCxiaXRbMTAwMDA1XTsKcGFpciA8aW50LGludD4gcFsxMDAwMDVdOwp2b2lkIFVQREFURShpbnQgaSwgaW50IHYpCnsKICAgIHdoaWxlIChpPD1uKSBiaXRbaV0rPXYsaSs9aSYoLWkpOwogICAgcmV0dXJuOwp9CmludCBHRVQoaW50IGwsIGludCByKQp7CiAgICBsLS07CiAgICBpbnQgcmVzbD0wLHJlc3I9MDsKICAgIHdoaWxlIChsPjApIHJlc2wrPWJpdFtsXSxsLT1sJigtbCk7CiAgICB3aGlsZSAocj4wKSByZXNyKz1iaXRbcl0sci09ciYoLXIpOwogICAgcmV0dXJuIHJlc3ItcmVzbDsKfQpzaWduZWQgbWFpbigpCnsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpLGNpbi50aWUoMCksY291dC50aWUoMCk7CiAgICBjaW4+Pm47CiAgICBmb3IgKGludCBpPTE7aTw9bjtpKyspIGNpbj4+cFtpXS5maXJzdCxwW2ldLnNlY29uZD1pOwogICAgc29ydChwKzEscCtuKzEsZ3JlYXRlcjxwYWlyPGludCxpbnQ+PigpKTsKICAgIGZvciAoaW50IGk9MTtpPD1uO2krKykKICAgIHsKICAgICAgICBVUERBVEUocFtpXS5zZWNvbmQsMSk7CiAgICAgICAgYW5zKz1HRVQoMSxwW2ldLnNlY29uZC0xKTsKICAgIH0KICAgIGNvdXQ8PGFuczw8J1xuJzsKICAgIHJldHVybiAwOwp9Cg==