#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005 
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);



using namespace std;


ll n;
ll a[Ma];
ll b[Ma];
ll ans[Ma],all[Ma],res=0;



void merage(ll l,ll r,ll len)
{
	if (l==r)
		return;
	ll mid=(l+r)>>1;
	merage(l,mid,len-1),merage(mid+1,r,len-1);
	ll cnt=0;
	ll i=l,j=mid+1,k=0;
	while (i<=mid&&j<=r){
		if (a[i]<=a[j]) b[k++]=a[i++];
		else cnt+=mid-i+1,b[k++]=a[j++];
	}
	while (j<=r) b[k++]=a[j++];
	while (i<=mid) b[k++]=a[i++];
	for (ll k=0;k<r-l+1;k++)
		a[l+k]=b[k];
	ans[len]+=cnt;
	all[len]+=(r-l+1)*(r-l)/2;
	return;
}
void sol()
{
	cin>>n;
	ll len=0,lim=1;
	while (lim<n)
		lim<<=1,len++;
	for (ll i=1;i<=n;i++)
		cin>>a[i];
	merage(1,n,len);
	ll res=0,pri=1;
	for (ll i=0;i<=len;i++)
		res+=ans[i],pri+=min(ans[i],all[i]-ans[i]);
	res=min(res,pri);
	printf("%lld\n",res);
}



int main()
{
	IOS
	ll tt=1;
	//cin>>tt;
	while (tt--)
		sol();
	return 0;
}