






from math import factorial






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


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



def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__    ):
				lowerCamelCase_						=			[0 for i in range(r + 1    )]
				# nc0 = 1
				lowerCamelCase_						=			1
				for i in range(1	, n + 1    ):
								# to compute current row from previous row.
								lowerCamelCase_						=			min(lowerCamelCase__	, lowerCamelCase__    )
								while j > 0:
												c[j] += c[j - 1]
												j -= 1
				return c[r]





print(binomial_coefficient(n=1_0, r=5))


