func main()
	var n: int :: cui@inputInt()
	var a: []int :: #[n]int
	for i(0, n - 1)
		do a[i] :: cui@inputInt()
	end for
	var lis: []int :: getLisArr(a)
	do a.reverse()
	var revLis: []int :: getLisArr(a)
	do revLis.reverse()
	do a.reverse()
	for i(0, n - 1)
		do a[i] :: -1 * a[i]
	end for
	var lds: []int :: getLisArr(a)
	do a.reverse()
	var revLds: []int :: getLisArr(a)
	do revLis.reverse()
	do a.reverse()
	
	var ans: int :: -1
	for i(0, n - 1)
		do ans :: [ans, lib@min(lis[i], revLis[i]) - 1, lib@min(lds[i], revLds[i]) - 1].max()
	end for
	do cui@print("\{ans}\n")
	
	func getLisArr(a: []int): []int
		const infInt: int :: lib@intMax
		var n: int :: ^a
		var buff: []int :: [infInt].repeat(n + 1)
		var lisArr: []int :: #[n]int
		for i(0, n - 1)
			var idx: int :: f(buff, a[i])
			do buff[idx] :: a[i]
			do lisArr[i] :: f(buff, infInt)
			func f(arr: []int, val: int): int
				var ok: int :: -1
				var ng: int :: ^arr - 1
				while((ok - ng).abs() > 1)
					var mid: int :: (ok + ng) / 2
					if(val > arr[mid])
						do ok :: mid
					else
						do ng :: mid
					end if
				end while
				ret ok + 1
			end func
		end for
		ret lisArr
	end func
end func