


"""simple docstring"""
def 						_a				(      _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				)    ->				Optional[int]:


							while a != 0:
														snake_case_           =		b % a, a
							return b







def 						_a				(      _SCREAMING_SNAKE_CASE				, _SCREAMING_SNAKE_CASE				)    ->				Tuple:


							if gcd(_lowerCamelCase				, _lowerCamelCase				) != 1:
														snake_case_           =		f"""mod inverse of {a!r} and {m!r} does not exist"""
														raise ValueError(_lowerCamelCase				)
							snake_case_           =		1, 0, a
							snake_case_           =		0, 1, m
							while va != 0:
														snake_case_           =		ua // va
														snake_case_           =		(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
							return ua % m







"""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())))



