#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ps push
#define in insert
#define f first
#define s second
#define nl cout<<"\n"
#define ca(v) for(auto i:v) cout<<i<<" ";
#define cbit(x) __builtin_popcount(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b/gcd(a, b))
int xm[4] = {-1, 1, 0, 0};
int ym[4] = {0, 0, -1, 1};
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll POW = 9973;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin>>n;
    vector<pair<int, int>> ar;
    n++;
    for(int i=0; i<n; i++){
        pair<int, int> p = {0,i};
        cin>>p.f;
        ar.pb(p);
    }
    sort(all(ar));
    // for(auto p:ar){
    //     cout<<p.f<<" "<<p.s<<"\n";
    // }
    int ans = 0;
    for(int i=0; i<n; i++){
        if(ar[i].s < i){
            // 01, 23, ...
            if(ar[i].s % 2 == 0){
                ans = max(ans, abs(ar[i].s-i));
            }
            else ans = max(ans, abs(ar[i].s-i) + 1);
        }
        else if(ar[i].s > i){
            if(ar[i].s % 2 ==1){
                ans = max(ans, abs(ar[i].s-i));
            }
            else ans = max(ans, abs(ar[i].s-i) + 1);
        }
    }
    cout<<ans;
}