#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

class BIT {
    int64 n;
    vector<int64> d;
public:
    BIT(int64 _n=0) {n=_n; d=vector<int64>(n+1);}
    void add(int64 i, int64 x=1) { for (i++; i <= n; i += i&-i) d[i] += x; }
    int64 sum(int64 i) { int64 x = 0; for (i++; i; i -= i&-i) x += d[i]; return x; }
};

int main() {
    int n;
    cin >> n;
    vector a(n,0);
    int a_max = 0;
    for (int i=0; i<n; i++) {
        cin >> a[i];
        a_max = max(a_max, a[i]);
    }

    BIT bit1(a_max+1);
    vector l(n,0);
    for (int i=0; i<n; i++) {
        l[i] = i - bit1.sum(a[i]);
        bit1.add(a[i]);
    }

    BIT bit2(a_max+1);
    vector r(n,0);
    for (int i=n-1; i>=0; i--) {
        r[n-1-i] = (n-1-i) - bit2.sum(a[i]);
        bit2.add(a[i]);
    }

    int ans = 0;
    for (int i=1; i<n-1; i++) {
        ans = max(ans, min(l[i], r[i]));
        ans = max(ans, min(n/2-l[i], n/2-r[i]));
    }

    cout << ans << endl;
}