#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;vl v(n);
    rep(i,n)cin >> v[i];
    vpl pls(n);rep(i,n)pls[i]={v[i],i};sort(all(pls));
    vvl dp(n,vl(2));//0なら左、1なら右
    rep(i,n){
        ll p=pls[i].se;
        ll left=0,right=0;
        rep(j,n){
            if(j<p&&v[j]<v[p])chmax(left,dp[j][0]);
            if(j>p&&v[j]<v[p])chmax(right,dp[j][1]);
        }
        dp[p][1]=left+1;
        dp[p][0]=right+1;
    }
    //rep(i,n)cout << dp[i][0] <<" "<<dp[i][1] <<endl;
    ll ans=0;
    rep(i,n)rep(j,2)chmax(ans,dp[i][j]);
    cout << ans <<endl;
}