#include <iostream>
#include <cstdio>
#include <map>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;
int n,a[1000005];
int pos[1000005];
int val1[20],val2[20];
struct node{
	int p,c;
	bool operator <(const node &x)const{
		return p<x.p;
	}
}d[1000005];
void dfs(int l,int r,int w){
	if (l==r-1){
		if (pos[l]>pos[r])val1[w]++;
		if (pos[l]<pos[r])val2[w]++;
		return;
	}
	int mid=(l+r)/2;
	int c0=0,c1=0;
	for (int i=l;i<=r;i++){
		d[i].p=pos[i];
		if (i<=mid)d[i].c=0,c0++;
		else d[i].c=1,c1++;
	}
	sort(d+l,d+1+r);
	for (int i=l;i<=r;i++)
		if (d[i].c==1)val1[w]+=c0,c1--;
		else val2[w]+=c1,c0--;
	dfs(l,mid,w-1);
	dfs(mid+1,r,w-1);
	return;
}
struct DS{
	int tree[1000005],n=1000000;
	void add(int p){
		while(p<=n)tree[p]++,p+=(p&(-p));
		return;
	} 
	int ask(int p){
		int ans=0;
		while(p)ans+=tree[p],p-=(p&(-p));
		return ans;
	}
}bit;
signed main(){
	cin>>n;
	for (int i=0;i<n;i++){
		scanf("%lld",&a[i]);
		pos[a[i]]=i;
	}
	int w=0;
	while((1<<w)!=n)w++;
	dfs(0,n-1,w);
	int ans=0;
	for (int i=1;i<=w;i++)ans+=min(val1[i],val2[i]);
	ans++;
	int t=0;
	for (int i=n-1;i>=0;i--)t+=bit.ask(a[i]+1),bit.add(a[i]+1);
	ans=min(ans,t);
	cout<<ans<<endl;
	return 0;
}