"""simple docstring"""


def 					__a   (		A      ):






     '''simple docstring'''



     stooge(A    ,				0    ,				len(A      ) - 1      )
     return arr







def 					__a   (		A    ,				A    ,				A      ):






     '''simple docstring'''



     if i >= h:
          return

     # If first element is smaller than the last then swap them
     if arr[i] > arr[h]:
          lowercase__ ,						lowercase__				 =							arr[h], arr[i]

     # If there are more than 2 elements in the array
     if h - i + 1 > 2:
          lowercase__				 =							(int)((h - i + 1) / 3      )

          # Recursively sort first 2/3 elements
          stooge(A    ,				A    ,				(h - t)      )

          # Recursively sort last 2/3 elements
          stooge(A    ,				i + t    ,				(A)      )

          # Recursively sort first 2/3 elements
          stooge(A    ,				A    ,				(h - t)      )


if __name__ == "__main__":
 lowerCAmelCase_:					int     =					input("Enter numbers separated by a comma:\n").strip()
 lowerCAmelCase_:					Union[str, Any]     =					[int(item) for item in user_input.split(",")]
 print(stooge_sort(unsorted))
"""simple docstring"""


import itertools
import math







def 					__a   (		A      ):






     '''simple docstring'''



     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(math.sqrt(A      ) + 1      )    ,				6      ):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True







def 					__a   (		):






     '''simple docstring'''



     lowercase__				 =							2
     while True:
          if is_prime(A      ):
               yield num
          num += 1







def 					__a   (		A = 1_00_01      ):






     '''simple docstring'''



     return next(itertools.islice(prime_generator()    ,				nth - 1    ,				A      )      )


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




