




from math import factorial





def        __UpperCAmelCase						(							lowerCamelCase_ :     int = 1_00  )       ->  int:







			"""simple docstring"""





			return sum(int(lowerCamelCase_  ) for x in str(factorial(lowerCamelCase_  )  )  )


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




from __future__ import annotations

_lowerCAmelCase       =		[True] * 1_000_001
_lowerCAmelCase       =		2
while i * i <= 1_000_000:
					if seive[i]:
										for j in range(i * i, 1_000_001, i):
															_lowerCAmelCase       =		False
					i += 1
def 					_snake_case	(  __snake_case						):
					return seive[n]
def 					_snake_case	(  __snake_case						):
					return any(digit in '''02468''' for digit in str(__snake_case						)						)
def 					_snake_case	(  __snake_case = 1000000						):
					_UpperCamelCase			     =     [2]  # result already includes the number 2.
					for num in range(3  ,     limit + 1  ,     2						):
										if is_prime(__snake_case						) and not contains_an_even_digit(__snake_case						):
															_UpperCamelCase			     =     str(__snake_case						)
															_UpperCamelCase			     =     [int(str_num[j:] + str_num[:j]						) for j in range(len(__snake_case						)						)]
															if all(is_prime(__snake_case						) for i in list_nums						):
																				result.append(__snake_case						)
					return result
def 					_snake_case	(  ):
					return len(find_circular_primes()						)


if __name__ == "__main__":
					print(f'{len(find_circular_primes()) = }')
