//比较好理解,不多说,自己悟吧(就是不会写难的。。。)
#include<iostream>
#include<cstdio>
#include<algorithm>
using
namespace
std;
int
a[500005],b[500005];
long
long
sum;
void
csort(
int
l,
int
r){
int
p1=l,mid=(r+l)/2;
int
p2=mid+1,p=l;
while
(p1<=mid&&p2<=r){
if
(a[p1]<=a[p2]){
b[p++]=a[p1++];
}
else
{
b[p++]=a[p2++];
sum=sum+mid-p1+1;
}
}
while
(p1<=mid){
b[p++]=a[p1++];
}
while
(p2<=r){
b[p++]=a[p2++];
}
for
(
int
i=l; i<=r; i++){
a[i]=b[i];
}
}
void
mesort(
int
l,
int
r){
if
(l==r){
return
;
}
int
mid=(l+r)/2;
mesort(l,mid);
mesort(mid+1,r);
csort(l,r);
}
int
main(){
// freopen("P1908_11.in","r",stdin);
// freopen("P1908_11.out","w",stdout);
int
n;
cin>>n;
for
(
int
i=1; i<=n; i++){
scanf
(
"%d"
,&a[i]);
}
mesort(1,n);
cout<<sum;
return
0;
}