


from math import factorial


def        _UpperCamelCase							(      lowercase__ = 100      ):
						return sum(int(lowercase__      ) for x in str(factorial(lowercase__      )      )      )


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




def        _UpperCamelCase							(      lowercase__    ,       lowercase__    ,       lowercase__=False      ):

						if isinstance(lowercase__    ,       lowercase__      ) and isinstance(lowercase__    ,       lowercase__      ):
												__SCREAMING_SNAKE_CASE						:     List[str]					=		len(set_a.intersection(lowercase__      )      )

												if alternative_union:
																		__SCREAMING_SNAKE_CASE						:     int					=		len(lowercase__      ) + len(lowercase__      )
												else:
																		__SCREAMING_SNAKE_CASE						:     int					=		len(set_a.union(lowercase__      )      )

												return intersection / union

						if isinstance(lowercase__    ,       (list, tuple)      ) and isinstance(lowercase__    ,       (list, tuple)      ):
												__SCREAMING_SNAKE_CASE						:     Dict					=		[element for element in set_a if element in set_b]

												if alternative_union:
																		__SCREAMING_SNAKE_CASE						:     Optional[int]					=		len(lowercase__      ) + len(lowercase__      )
																		return len(lowercase__      ) / union
												else:
																		__SCREAMING_SNAKE_CASE						:     Tuple					=		set_a + [element for element in set_b if element not in set_a]
																		return len(lowercase__      ) / len(lowercase__      )

												return len(lowercase__      ) / len(lowercase__      )
						return None


if __name__ == "__main__":
						__lowerCAmelCase	: List[Any]  				={'a', 'b', 'c', 'd', 'e'}
						__lowerCAmelCase	: Optional[Any]  				={'c', 'd', 'e', 'f', 'h', 'i'}
						print(jaccard_similarity(set_a, set_b))
