//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

//debug
#define DEBUG

#define DUMPOUT cout

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n;
int a[100000 + 5];
vector<vector<int>> v(100000 + 5);

struct BIT {
    int size;
    vector<int> node;

    BIT(int n, long long init_num) {
        size = n;
        node.resize(size + 1, init_num);
    }

    void add(int i, long long x) {
        while (i <= size) {
            node[i] += x;
            i += i & -i;
        }
    }

    long long sum(int i) {
        long long ret = 0;
        while (i > 0) {
            ret += node[i];
            i -= i & -i;
        }
        return ret;
    }
};

BIT bitl(100000 + 5, 0), bitr(100000 + 5, 0);
int ans = 0;
int mx = 0;

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  rep(i, n) {
    cin >> a[i];
    v[a[i]].push_back(i + 1);
    mx = max(mx, a[i]);
  }
  int l = 1;
  int r = n;
  rep2(i, 1, mx) {
    vector<int> pos = v[i];
    if (pos.size() == 0) continue;
    rep(j, pos.size()) {
      int prepos = pos[j];
      pos[j] += bitl.sum(100000 + 1) - bitl.sum(prepos);
      pos[j] -= bitr.sum(prepos);
    }
    int mnd = 0;
    int tmpr = r;
    vector<int> cost(pos.size());
    rrep2(j, pos.size() - 1, -1) {
      mnd += tmpr - pos[j];
      cost[j] = tmpr - pos[j];
      tmpr--;
    }
    int tmpl = l;
    int tmpmnd = mnd;
    int m = -1;
    rep(j, pos.size()) {
      tmpmnd -= cost[j];
      tmpmnd += pos[j] - tmpl;
      if (mnd > tmpmnd) {
        tmpl++;
        mnd = tmpmnd;
        tmpr++;
        m = j;
      }
      else break;
    }
    rep(j, pos.size()) {
      //cout << v[i][j] << endl;
      if (j <= m) bitl.add(v[i][j], 1);
      else bitr.add(v[i][j], 1);
    }
    ans += mnd;
    l = tmpl;
    r = tmpr;
  }
  cout << ans << endl;
}



Measured memory_bytes: 10704