



from math import factorial




def 	UpperCAmelCase   (						_lowerCamelCase = 100    ):
			return sum(int(_lowerCamelCase    ) for x in str(factorial(_lowerCamelCase    )    )    )


if __name__ == "__main__":
							print(solution(int(input("""Enter the Number: """).strip())))




from collections.abc import Sequence




def 	UpperCAmelCase   (						_lowerCamelCase = None    ):
			if nums is None or not nums:
						raise ValueError("Input sequence should not be empty"    )

			A							:					Dict              =						nums[0]
			for i in range(1 ,    len(_lowerCamelCase    )    ):
						A							:					Tuple              =						nums[i]
						A							:					List[Any]              =						max(_lowerCamelCase ,    ans + num ,    _lowerCamelCase    )

			return ans


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							# Try on a sample input from the user
							__SCREAMING_SNAKE_CASE           =  int(input("""Enter number of elements : """).strip())
							__SCREAMING_SNAKE_CASE           =  list(map(int, input("""\nEnter the numbers : """).strip().split()))[:n]
							print(max_subsequence_sum(array))