#include<iostream>
#include<algorithm>
using namespace std;
int N;
int A[1<<17];
int L[1<<17],R[1<<17];
int X[1<<17],Y[1<<17];
int calc()
{
	for(int i=0;i<=N;i++)
	{
		L[i]=2e9;
		R[i]=2e9;
	}
	L[0]=-2e9;
	for(int i=0;i<N;i++)
	{
		int id=lower_bound(L,L+N,A[i])-L;
		L[id]=A[i];
		X[i]=id;
	}
	R[0]=-2e9;
	for(int i=N;i--;)
	{
		int id=lower_bound(R,R+N,A[i])-R;
		R[id]=A[i];
		Y[i]=id;
	}
	int Rm=0;
	int ans=0;
	for(int i=N;i--;)
	{
		if(Rm<Y[i])Rm=Y[i];
		int x=Rm<X[i]?Rm:X[i];
		if(ans<x-1)ans=x-1;
	}
	return ans;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	int ans=calc();
	for(int i=0;i<N;i++)A[i]*=-1;
	cout<<max(ans,calc())<<endl;
}