#include<bits/stdc++.h>
using namespace std;
int m;
void quicksort(int s[],int a,int b)
{
int left=a,right=b,num;
if(left<right)
{
num=s[left];
while(left!=right)
{
while(right>left&&++m&&s[right]>=num) right--;
s[left]=s[right];
while(left<right&&++m&&s[left]<=num) left++;
s[right]=s[left];
}
s[left]=num;
quicksort(s,a,left-1);
quicksort(s,left+1,b);
}
}
int main()
{
int n;
scanf("%d",&n);
int data[100001];
for(int i=1;i<=n;i++)
{
scanf("%d",&data[i]);
}
quicksort(data,1,n);
printf("%d",m);
return 0;
}