题解 | #Redraiment的走法#

num = int(input().strip())
step = 0
list1 = list(map(int,input().strip().split(" ")))
def computestep(list1,num):
    re = [1]*num
    for i in range(num-1,-1,-1):
        try:
            re[i] += max([re[j] for j in range(i,num) if list1[j]>list1[i]])
        except:
            continue
    return re
print(max(computestep(list1,num)))