#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
// #pragma GCC optimize ("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 3e5 + 5;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

// order_of_key(k): returns the number of elements in the set strictly less than k
// find_by_order(k): returns an iterator to the k-th element (zero-based) in the set

int n, pos[N];
vector<int> c;
ordered_set st;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);

    cin >> n;
    c.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
        pos[c[i]] = i;
    }
    sort(c.begin(), c.end());
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        int cur_pos = pos[c[i]];
        int less_cnt = st.order_of_key(cur_pos);
        int steps_left = cur_pos - less_cnt;
        int higher_cnt = i - less_cnt;
        int steps_right = n - 1 - cur_pos - higher_cnt;
        ans += min(steps_left, steps_right);
        st.insert(cur_pos);
    }
    cout << ans << '\n';
    return 0;
}