import sys
input = sys.stdin.readline
from collections import *

class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(n+1)

    def add(self, i, x):
        i += 1
        
        while i<=self.n:
            self.bit[i] = max(self.bit[i], x)
            i += i&(-i)

    def acc(self, i):
        s = 0
        
        while i>0:
            s = max(s, self.bit[i])
            i -= i&(-i)
        
        return s

N = int(input())
A = list(map(int, input().split()))
ans = 0
iA = [(i, A[i]) for i in range(N)]
iA.sort(key=lambda t: (t[1], -t[0]))
dpl = [0]*N
bit = BIT(N)

for i, _ in iA:
    dpl[i] = bit.acc(i)+1
    bit.add(i, dpl[i])

A.reverse()
iA = [(i, A[i]) for i in range(N)]
iA.sort(key=lambda t: (t[1], -t[0]))
dpr = [0]*N
bit = BIT(N)

for i, _ in iA:
    dpr[i] = bit.acc(i)+1
    bit.add(i, dpr[i])

A.reverse()
dpr.reverse()

for i in range(N):
    ans = max(ans, min(dpl[i], dpr[i])-1)

A = list(map(lambda x: -x, A))
iA = [(i, A[i]) for i in range(N)]
iA.sort(key=lambda t: (t[1], -t[0]))
dpl = [0]*N
bit = BIT(N)

for i, _ in iA:
    dpl[i] = bit.acc(i)+1
    bit.add(i, dpl[i])

A.reverse()
iA = [(i, A[i]) for i in range(N)]
iA.sort(key=lambda t: (t[1], -t[0]))
dpr = [0]*N
bit = BIT(N)

for i, _ in iA:
    dpr[i] = bit.acc(i)+1
    bit.add(i, dpr[i])

A.reverse()
dpr.reverse()

for i in range(N):
    ans = max(ans, min(dpl[i], dpr[i])-1)

print(ans)