from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

n=II()
aa=LI()

lis=[]
ll=[0]*n
for i,a in enumerate(aa):
    j=bisect_left(lis,a)
    if j==len(lis):lis.append(a)
    else:lis[j]=a
    ll[i]=j
#print(ll)

lis=[]
aa.reverse()
rr=[0]*n
for i,a in enumerate(aa):
    j=bisect_left(lis,a)
    if j==len(lis):lis.append(a)
    else:lis[j]=a
    rr[i]=j
rr.reverse()
#print(rr)

ans=0
for i in range(n):
    ans=max(ans,min(ll[i],rr[i]))

mx=10**9+5
aa=[mx-a for a in aa]
lis=[]
ll=[0]*n
for i,a in enumerate(aa):
    j=bisect_left(lis,a)
    if j==len(lis):lis.append(a)
    else:lis[j]=a
    ll[i]=j
#print(ll)

lis=[]
aa.reverse()
rr=[0]*n
for i,a in enumerate(aa):
    j=bisect_left(lis,a)
    if j==len(lis):lis.append(a)
    else:lis[j]=a
    rr[i]=j
rr.reverse()
#print(rr)

for i in range(n):
    ans=max(ans,min(ll[i],rr[i]))

print(ans)