from math import factorial







def       A__   (						snake_case_			:		int = 100   ):
 return sum(map(snake_case_							,					str(factorial(snake_case_   )   )   )   )


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




'''simple docstring'''



def       snake_case   (	snake_case      : list			) ->  list:


    """simple docstring"""


    if any(not isinstance(snake_case					,		snake_case			) or x < 0 for x in sequence			):
        raise TypeError('Sequence must be list of non-negative integers'			)
    for _ in range(len(snake_case			)			):
        for i, (rod_upper, rod_lower) in enumerate(zip(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]





