/**
* ┏┓ ┏┓
* ┏┛┗━━━━━━━┛┗━━━┓
* ┃ ┃
* ┃ ━ ┃
* ┃ > < ┃
* ┃ ┃
* ┃... ⌒ ... ┃
* ┃ ┃
* ┗━┓ ┏━┛
* ┃ ┃ Code is far away from bug with the animal protecting
* ┃ ┃ 神兽保佑,代码无bug
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┗━━━┓
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 100005
#define nm 1000005
#define pi 3.1415926535897931
using namespace std;
const int inf=1000000007;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,a[NM],d[NM],c[NM],f[NM],ans,len;
int main(){
n=read();if(n==1)return 0*printf("1\n");
dec(i,n,1)a[i]=read();
d[len=1]=a[1];c[1]=1;
inc(i,2,n){
if(d[len]>=a[i])d[lower_bound(d,d+1+len,a[i])-d]=a[i];
else d[++len]=a[i];
c[i]=len;
}
mem(d);d[len=1]=-a[n];f[n]=1;d[0]=-inf;
dec(i,n-1,1){
if(d[len]>=-a[i])d[lower_bound(d,d+1+len,-a[i])-d]=-a[i];
else d[++len]=-a[i];
f[i]=len;
}
//inc(i,1,n)printf("%d ",b[i]);putchar('\n');
//inc(i,1,n)printf("%d ",f[i]);putchar('\n');
inc(i,1,n)ans=max(ans,c[i]+f[i+1]);
return 0*printf("%d\n",ans);
}