#include<iostream>
using namespace std;
int a[100001],cnt;
void qSort(int left,int right)
{
	int mid=a[(left+right)/2],key=a[mid],i=left,j=right;
	while(i<=j)
	{
		while(a[i]<mid)
		{
			i++;
		}
		while(a[j]>mid)
		{
			j--;
		}
		if(i<=j)
        {
            swap(a[i],a[j]);
			cnt++;
            i++;
            j--;           
        }
	}
	if(left<j) qSort(left,j);
    if(i<right) qSort(i,right);
	return;
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	qSort(1,n);
	printf("%d",cnt);
	return 0;
}