input = open(0).readline

n = int(input())
a = list(map(int,input().split()))
dp = [0]*n + [0]
for i in range(n):
    # 找比a[i]小的中dp最大的
    b = max(list(filter(lambda x:a[x] <= a[i], range(i))) or [-1],key=lambda a:dp[a])
    dp[i] = dp[b] + 1
print(max(dp))