






from collections.abc import Iterable
from typing import Generic, TypeVar

__UpperCAmelCase								=						TypeVar('_T')



class   lowerCamelCase      (Generic[_T]			):







		'''simple docstring'''



		def __init__(							self				,		_UpperCamelCase = None   )	->							Optional[Any]:
							UpperCAmelCase_    :      Optional[int]            =						list(iterable or []   )
							UpperCAmelCase_    :      List[Any]            =						[]



		def __len__(							self   )	->							Union[str, Any]:
							return len(self._stacka   ) + len(self._stacka   )



		def __repr__(							self   )	->							int:
							return f"Queue({tuple(self._stacka[::-1] + self._stacka   )})"



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase   )	->							Optional[int]:
							self._stacka.append(_lowerCAmelCase   )



		def 					__UpperCAmelCase			(							self   )	->							Union[str, Any]:
							UpperCAmelCase_    :      Union[str, Any]            =						self._stacka.pop
							UpperCAmelCase_    :      Optional[int]            =						self._stacka.append

							if not self._stacka:
												while self._stacka:
																	stacka_append(stacka_pop()   )

							if not self._stacka:
												raise IndexError('Queue is empty'   )
							return self._stacka.pop()


if __name__ == "__main__":
		from doctest import testmod

		testmod()












from math import sqrt

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	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(__UpperCAmelCase							) + 1							)			,			6							):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	int = 1_00_01							)					-> int:
      SCREAMING_SNAKE_CASE_							=			0
      SCREAMING_SNAKE_CASE_							=			1
      while count != nth and number < 3:
            number += 1
            if is_prime(__UpperCAmelCase							):
                  count += 1
      while count != nth:
            number += 2
            if is_prime(__UpperCAmelCase							):
                  count += 1
      return number


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