#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define sz(x)  (int)x.size()
#define bigint __int128
#define el '\n'
#define ll long long
#define ld long double
using namespace std;
const int N = 1e5 + 4, M = 1e5 + 10, mod = 998244353;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void acc() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++)cin >> v[i];
    ordered_set<int> l, r;
    for (int i = 0; i < n; i++)r.insert(v[i]);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int lans = sz(l) - l.order_of_key(v[i]);
        r.erase(v[i]);
        int rans = sz(r) - r.order_of_key(v[i]);
        l.insert(v[i]);
        ans += min(rans, lans);
    }
    cout << ans << el;

}

int main() {
    int t = 1;
    cout.tie(0);
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    //  while (t--)acc();
    acc();
}