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

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned uint;
typedef __int128 bint;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for unsigned long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int n;
    cin >> n;
    vector<ll> suff(n);
    ordered_set<int> a, b;
    vector<int> v(n), mx(n);
    for(int i = 0; i < n; i++)
        cin >> v[i];


    for(int i = n - 1; i >= 0; i--)
    {
        mx[i] = v[i];
        suff[i] = b.size() - b.order_of_key(v[i]);
        b.insert(v[i]);

        if(i + 1 < n)
            suff[i] += suff[i + 1], mx[i] = max(mx[i], mx[i + 1]);
    }

    ll ans = suff[0], invA = 0;
    for(int i = 0; i + 1 < n; i++)
    {
        invA += a.size() - a.order_of_key(v[i]);
        a.insert(v[i]);

        if(*a.rbegin() > mx[i + 1])
            ans = min(ans, invA + suff[i + 1]);
    }

    invA += a.size() - a.order_of_key(v.back());
    ans = min(ans, invA);

    cout << ans;

}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}