N=int(input())
A=list(map(int,input().split()))

DP1=[[1]*N for i in range(N)]
DP2=[[1]*N for i in range(N)]

for kukan in range(1,N+1):
    for i in range(N):
        if i+kukan==N:
            break
        DP2[i][i+kukan]=max(DP2[i][i+kukan],DP2[i][i+kukan-1])
        if A[i]<A[i+kukan]:
            DP2[i][i+kukan]=max(DP2[i][i+kukan],DP1[i+1][i+kukan]+1)

    for i in range(N-1,-1,-1):
        if i-kukan==-1:
            break
        DP1[i-kukan][i]=max(DP1[i-kukan][i],DP1[i-kukan+1][i])
        if A[i]<A[i-kukan]:
            DP1[i-kukan][i]=max(DP2[i-kukan][i-1]+1,DP1[i-kukan][i])

    

ANS=0
for i in range(N):
    for j in range(N):
        ANS=max(ANS,DP1[i][j],DP2[i][j])

print(ANS)