
"""simple docstring"""

from math import sqrt






def 							A						(    snake_case				:int		)				->     bool:

 if 1 < number < 4:
  # 2 and 3 are primes
  return True
 elif number < 2 or number % 2 == 0 or number % 3 == 0:
  # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
  return False

 # All primes number are in format of 6k +/- 1
 for i in range(5    , int(sqrt(snake_case		) + 1		)    , 6		):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True






def 							A						(    snake_case				:int = 1_0_0_0_1		)				->     int:
 __UpperCamelCase      =	0
 __UpperCamelCase      =	1
 while count != nth and number < 3:
  number += 1
  if is_prime(snake_case		):
   count += 1
 while count != nth:
  number += 2
  if is_prime(snake_case		):
   count += 1
 return number


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





"""simple docstring"""

from math import factorial

UpperCamelCase     :    List[Any]       =			{str(d): factorial(d) for d in range(1_0)}






def 							A						(    snake_case				:int		)				->     int:
 return sum(DIGIT_FACTORIAL[d] for d in str(snake_case		)		)






def 							A						(    )				->     int:
 __UpperCamelCase      =	7 * factorial(9		) + 1
 return sum(i for i in range(3    , snake_case		) if sum_of_digit_factorial(snake_case		) == i		)


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



