


"""simple docstring"""
def 						_a				(      _SCREAMING_SNAKE_CASE				)    ->				list:
							if any(not isinstance(_SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				) or x < 0 for x in sequence				):
														raise TypeError("""Sequence must be list of non-negative integers"""				)
							for _ in range(len(_SCREAMING_SNAKE_CASE				)				):
														for i, (rod_upper, rod_lower) in enumerate(zip(_SCREAMING_SNAKE_CASE				, sequence[1:]				)				):
																					if rod_upper > rod_lower:
																												sequence[i] -= rod_upper - rod_lower
																												sequence[i + 1] += rod_upper - rod_lower
							return sequence


if __name__ == "__main__":
				assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
				assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]







"""simple docstring"""
from math import factorial







def 						_a				(      _SCREAMING_SNAKE_CASE = 100				)    ->				int:
							return sum(int(_SCREAMING_SNAKE_CASE				) for x in str(factorial(_SCREAMING_SNAKE_CASE				)				)				)


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



