#include <stdio.h>

#define M 100001
#define N 200000
#define INFTY 1000000000
long long count;

void merge(int A[],int left,int  mid, int  right)
{
	int i,j,k,n1,n2,L[M],R[M];
 	n1 = mid - left;
  	n2 = right - mid;
  
	
	for (i = 0; i<n1; i++) 
	{
		L[i]=A[left+i];
	}
	for(i = 0; i<n2; i++)
	{
		R[i]=A[mid+i];
 
	}

  	L[n1] = INFTY;
  	R[n2] = INFTY;
  	i = 0;
  	j = 0;
  	
	for (k = left; k<right; k++)
	{
		if (L[i] <= R[j]) 
		{
			A[k] = L[i];
      		i++;
		}
    else 
		{
			A[k] = R[j];
      		j++;
			count += n1-i;
		}
	}
}


void mergeSort(int A[],int left,int right)
{
	int mid;
	if (left+1 < right)
	{
    	mid = (left + right)/2;
    	mergeSort(A,left, mid);
    	mergeSort(A,mid, right);
    	merge(A,left, mid, right);
	}
}


int main()
{
	
	int n,i,A[N];
	count = 0;
	scanf("%d",&n);
	for(i = 0; i< n; i++)
	{
		scanf("%d",&A[i]);
	}
	
	mergeSort(A,0,n);
	
	 printf("%ld\n", count);   
	return 0;
}
