#include<iostream>
#include <algorithm>
using namespace std;
//2134978
//finding longest inc sub at each i first
int lis(int * arr, int n){
int * lisSize = new int[n+1];
int j,k,i,M;
if( n == 1 || n==0 ){
return 1;
}
for( i=0;i<n;i++){
int cnt=1;
M=arr[i];
int endind;
for(j=i+1;j<n;j++){
if(arr[j]>M){
M=arr[j];
endind = j;
cnt++;
}
}
int m = arr[endind];
for(k=endind;k<n;k++){
if(arr[k+1]<m){
m=arr[k+1];
cnt++;
}
}
lisSize[i]=cnt;
}
//for(int x=0;x<n;x++)
// cout<<lisSize[x]<<" ";
int * ans = max_element(lisSize, lisSize + n);
return *ans;
}
int main(){
int n;
cin>>n;
int arr[n+1];
for(int i=0;i<n;i++){
cin>>arr[i];
}
cout<<lis(arr,n);
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlIDxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwovLzIxMzQ5NzgKLy9maW5kaW5nIGxvbmdlc3QgaW5jIHN1YiBhdCBlYWNoIGkgZmlyc3QKaW50IGxpcyhpbnQgKiBhcnIsIGludCBuKXsKCgogICAgaW50ICogbGlzU2l6ZSA9IG5ldyBpbnRbbisxXTsKICAgIGludCBqLGssaSxNOwoKICAgIGlmKCBuID09IDEgfHwgbj09MCApewogICAgICAgIHJldHVybiAxOwogICAgfQogICAgZm9yKCBpPTA7aTxuO2krKyl7CiAgICAgICAgaW50IGNudD0xOwogICAgICAgIE09YXJyW2ldOwogICAgICAgIGludCBlbmRpbmQ7CiAgICAgICAgZm9yKGo9aSsxO2o8bjtqKyspewoKICAgICAgICAgICAgaWYoYXJyW2pdPk0pewogICAgICAgICAgICAgICAgTT1hcnJbal07CiAgICAgICAgICAgICAgICBlbmRpbmQgPSBqOwogICAgICAgICAgICAgICAgY250Kys7CgoKICAgICAgICAgICAgfQoKICAgICAgICB9CgogICAgICAgIGludCBtID0gYXJyW2VuZGluZF07CgogICAgICAgIGZvcihrPWVuZGluZDtrPG47aysrKXsKCiAgICAgICAgICAgIGlmKGFycltrKzFdPG0pewogICAgICAgICAgICAgICAgbT1hcnJbaysxXTsKICAgICAgICAgICAgICAgIGNudCsrOwoKICAgICAgICB9CiAgICAgICAgfQoKICAgICAgICBsaXNTaXplW2ldPWNudDsKCgoKICAgIH0KICAgIC8vZm9yKGludCB4PTA7eDxuO3grKykKICAgIC8vICAgIGNvdXQ8PGxpc1NpemVbeF08PCIgIjsKICAgIGludCAqIGFucyA9IG1heF9lbGVtZW50KGxpc1NpemUsIGxpc1NpemUgKyBuKTsKICAgIHJldHVybiAqYW5zOwoKfQoKCmludCBtYWluKCl7CgogICAgaW50IG47CiAgICBjaW4+Pm47CiAgICBpbnQgYXJyW24rMV07CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKXsKICAgICAgICBjaW4+PmFycltpXTsKICAgIH0KCiAgICBjb3V0PDxsaXMoYXJyLG4pOwoKCn0K