from bisect import bisect_left
N = int(input())
A = list(map(int,input().split()))
INFTY = 10**9+100
C = [-INFTY]
B1 = [0]*N
B2 = [0]*N
for i in range(N):
    ind = bisect_left(C,A[i])
    B1[i] = ind
    if ind<len(C):
        C[ind] = A[i]
    else:
        C.append(A[i])
C = [-INFTY]
for i in range(N-1,-1,-1):
    ind = bisect_left(C,A[i])
    B2[i] = ind
    if ind<len(C):
        C[ind] = A[i]
    else:
        C.append(A[i])
ans = 0
for i in range(N):
    ans = max(ans,min(B1[i],B2[i]))
A = [-A[i] for i in range(N)]
C = [-INFTY]
B1 = [0]*N
B2 = [0]*N
for i in range(N):
    ind = bisect_left(C,A[i])
    B1[i] = ind
    if ind<len(C):
        C[ind] = A[i]
    else:
        C.append(A[i])
C = [-INFTY]
for i in range(N-1,-1,-1):
    ind = bisect_left(C,A[i])
    B2[i] = ind
    if ind<len(C):
        C[ind] = A[i]
    else:
        C.append(A[i])
for i in range(N):
    ans = max(ans,min(B1[i],B2[i]))
print(ans-1)