



'''simple docstring'''


from __future__ import annotations






def  __lowerCAmelCase (__lowerCAmelCase   ):  # This function is recursive
		_UpperCAmelCase		:       Tuple								=      len(__lowerCAmelCase   )
		# If the array contains only one element, we return it (it's the stop condition of
		# recursion)
		if array_length <= 1:
				return array
				# Else
		_UpperCAmelCase		:       List[Any]								=      array[0]
		_UpperCAmelCase		:       List[Any]								=      False
		_UpperCAmelCase		:       Dict								=      1
		_UpperCAmelCase		:       list[int]								=      []
		while not is_found and i < array_length:
				if array[i] < pivot:
						_UpperCAmelCase		:       List[Any]								=      True
						_UpperCAmelCase		:       List[Any]								=      [element for element in array[i:] if element >= array[i]]
						_UpperCAmelCase		:       List[str]								=      longest_subsequence(__lowerCAmelCase   )
						if len(__lowerCAmelCase   ) > len(__lowerCAmelCase   ):
								_UpperCAmelCase		:       Optional[int]								=      temp_array
				else:
						i += 1

		_UpperCAmelCase		:       List[str]								=      [element for element in array[1:] if element >= pivot]
		_UpperCAmelCase		:       Tuple								=      [pivot, *longest_subsequence(__lowerCAmelCase   )]
		if len(__lowerCAmelCase   ) > len(__lowerCAmelCase   ):
				return temp_array
		else:
				return longest_subseq


if __name__ == "__main__":
						import doctest

						doctest.testmod()







'''simple docstring'''


import os






def  __lowerCAmelCase ():
		_UpperCAmelCase		:       List[Any]								=      os.path.join(os.path.dirname(__lowerCAmelCase   )      , "num.txt"   )
		with open(__lowerCAmelCase   ) as file_hand:
				return str(sum(int(__lowerCAmelCase   ) for line in file_hand   )   )[:10]


if __name__ == "__main__":
						print(solution())



