'''
最长连续递增子序列
dp[i]以nums[i]结尾的最长递增子序列的长度
if nums[i] > nums[j], 说明nums[i]能缀到nums[j]后面,
那么dp[j]就能+1了
dp[i+1] = max(dp[i + 1], dp[j] + 1)
'''
def length_of_lis(nums):
len_nums = len(nums)
if len_nums == 0:
return 0
dp = [1] * len_nums
for i in range(len_nums - 1):
for j in range(i + 1):
# 如果nums[i+1]能缀在nums[j]后面的话,就dp[j]+1
if nums[i + 1] > nums[j]:
# 缀完的结果还要看看是不是比我大
dp[i + 1] = max(dp[i + 1], dp[j] + 1)
return max(dp)
if __name__ == '__main__':
nums = [int(x) for x in input().split()]
res = length_of_lis(nums)
print(res)