#include<bits/stdc++.h>
using namespace std;
int nxd(int a[],int l,int r)
{
    long long count;
	int mid=(l+r)/2,index=r;
	if(l>=r) return 0;
	count=count+nxd(a,l,mid)+nxd(a,mid+1,r);
	sort(a+l,a+mid+1,greater<int>());
	sort(a+mid+1,a+r+1,greater<int>());
	for(int i=mid;i>=l;i--)
	{
		for(int j=index;j>=mid+1;j--)
		{
	
		while(a[i]>a[j])
		{
			index--;
			count+=i-l+1;
		}
		
		}
	}
	return count;
}
int main()
{
	long long s;int b[500000];
	cin>>s;
	for(int k=0;k<s;k++)
	cin>>b[k];
	cout<<nxd(b,0,s-1);
	return 0; 
}