

"""simple docstring"""




import itertools
import math
def 	lowerCAmelCase    (       __UpperCamelCase   ):
 '''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(__UpperCamelCase   ) + 1   )				,     6   ):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True
def 	lowerCAmelCase    (       ):
 '''simple docstring'''





 UpperCAmelCase__       :	Dict        =       2
 while True:
  if is_prime(__UpperCamelCase   ):
   yield num
  num += 1
def 	lowerCAmelCase    (       __UpperCamelCase = 10001   ):
 '''simple docstring'''





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


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













def 		__UpperCAmelCase     (	a_ = 10**9):
							snake_case_           =				1
							snake_case_           =				2

							snake_case_           =				0
							snake_case_           =				0
							snake_case_           =				0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														snake_case_           =				2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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





