


from math import isqrt
def 				UpperCAmelCase_					(							__snake_case						)     ->			list[int]:







 """simple docstring"""


 _lowercase							      =[True] * max_number
 for i in range(2     ,						isqrt(max_number - 1						) + 1						):
  if is_prime[i]:
   for j in range(i**2     ,						__snake_case     ,						__snake_case						):
    _lowercase							      =False

 return [i for i in range(2     ,						__snake_case						) if is_prime[i]]
def 				UpperCAmelCase_					(							__snake_case = 10**8						)     ->			int:







 """simple docstring"""


 _lowercase							      =calculate_prime_numbers(max_number // 2						)

 _lowercase							      =0
 _lowercase							      =0
 _lowercase							      =len(__snake_case						) - 1
 while left <= right:
  while prime_numbers[left] * prime_numbers[right] >= max_number:
   right -= 1
  semiprimes_count += right - left + 1
  left += 1

 return semiprimes_count


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




from math import factorial




def 			UpperCAmelCase__				(			_A      : int = 1_00							):





  '''simple docstring'''







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


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