#include <bits/stdc++.h>
using namespace std;
int num = 0;
void MergeandCut(int a[],int L, int mid,int R){
int* temp = new int[R - L + 1];
int i = L;
int j = mid + 1;
int t = 0;
while( i <= mid && j <= R){
if(a[i] > a[j]){
num += j - t;
temp[t++] = a[j++];
}
else
temp[t++] = a[i++];
}
while(i <= mid)
temp[t++] = a[i++];
while(j<=R)
temp[t++] = a[j++];
for(int k = 0; k <= R - L; k++)
a[L+k] = temp[k];
delete temp;
}
void mergesort(int a[], int L,int R){
if(L < R){
int mid = L + (R - L ) / 2;
mergesort(a, L,mid);
mergesort(a, mid+1,R);
MergeandCut(a,L,mid,R);
}
}
int main()
{
int a[] = {1,1};
mergesort(a,0,1);
printf("%d",num);
return 0;
}