#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lowbit(x) (x)&(-x)
const int maxn=(1<<12)+10,maxk=1000+10,MOD=10056;
int n,m,k,b[maxn];
int C[maxn];
struct node{
int val,pos;
bool operator <(node x){ return val<x.val; }
}a[maxn]; //a为输入的序列
//int lowbit(int x) {return x&(-x);}
LL sum(int x){
LL ret=0;
while (x>0) ret+=C[x],x-=lowbit(x);
return ret;
}
void add(int x,int d){
while (x<=n) C[x]+=d,x+=lowbit(x);
}
int main() {
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&a[i].val);
a[i].pos=i;
}
sort(a+1,a+n+1);
int cnt=1;
for (int i=1;i<=n;i++){ //b对a进行离散化
if (i!=1&&a[i].val!=a[i-1].val) cnt++;
b[a[i].pos]=cnt;
}
int ans=0;
for (int i=1;i<=n;i++){
add(b[i],1);
ans+=i-sum(b[i]);
}
printf("%d\n",ans);
}
BIT除了可以用来解决单点加、区间求和问题外,还可以用来解决区间加、单点求和问题。