#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 400010
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int n,a[N],b[N],pos[N];
unordered_map<int,int>mp;int tot;
vector<int>G[N];int cnt[N];
int main() {
	n=rd()+1;
	rep(i,1,n) a[i]=rd(),b[i]=a[i];
	sort(b+1,b+n+1);
	rep(i,1,n) if(i==1||b[i]!=b[i-1]) mp[b[i]]=++tot;
	rep(i,1,n) a[i]=mp[a[i]],G[a[i]].push_back(i),cnt[a[i]]++;
	rep(i,1,tot) cnt[i]+=cnt[i-1];
	drep(i,n,1) pos[i]=cnt[a[i]]--;
	
	int ans=0;
	rep(i,1,n) {
		if(pos[i]==i) continue;
		if(pos[i]>i) {
			ans=max(ans,pos[i]-i+((i&1)==0||((i&1)==1&&a[i+1]>a[i])));
		}
		else {
			ans=max(ans,i-pos[i]+((i&1)==1||((i&1)==0&&a[i-1]<a[i])));
		}
//		cerr<<"FUCK "<<i<<" "<<pos[i]<<" "<<ans<<endl;
	}
	printf("%d",ans);
	return 0;
}