#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) x&(-x)
/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
const int N = 200000;
int a[500005],tree[200005];int n;
void upd(int pos,int add){
	for(int i = pos;i<=N;i+=lowbit(i))tree[i]+=add;
}int query(int pos){
	int res =0;for(int i = pos;i>0;i-=lowbit(i))res+=tree[i];return res;
}pair<int,int> p[500005];
bool cmp(pair<int,int>a,pair<int,int>b){
	if(a.first == b.first)return a.second<b.second;
	return a.first>b.first;
}
signed main(){
	cin >> n;
	for(int i = 1;i<=n;i++)cin >> a[i];
	for(int i = 1;i<=n;i++){
		p[i].first = a[i],p[i].second= i;
	}sort(p+1,p+1+n,cmp);int ans = 0;
//	for(int i = 1;i<=n;i++)cout << p[i].second << " ";cout << endl;
	for(int i = 1;i<=n;){
		int j = i;
		while(j<=n){
			int k = query(p[j].second);ans+=min(k,i-1-k);
			if(a[p[j].second]!=a[p[j+1].second])break;j++;
		}for(int k = i;k<=j;k++)upd(p[k].second,1);
		i = j+1;
	}cout << ans << endl;
}