题解 | #Redraiment的走法#

N = int(input())

nums = list(map(int,input().strip().split()))

dp = [1]*N

for i in reversed(range(N)):  #  ->5,4,3,2,1,0
    for j in range(i+1, N):
        if nums[j] > nums[i]: # increasing
            dp[i] = max(dp[i],dp[j]+1)


print(max(dp))