



import math
import unittest






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int     ):



 """simple docstring"""





 assert isinstance(__lowerCamelCase		,	__lowerCamelCase     ) and (
     number >= 0
 ), "'number' must been an int and positive"

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

class       _SCREAMING_SNAKE_CASE	(unittest.TestCase ):





     def 	__snake_case    (       self :							str				)->Union[str, Any]:
      self.assertTrue(is_prime(2				)				)
      self.assertTrue(is_prime(3				)				)
      self.assertTrue(is_prime(5				)				)
      self.assertTrue(is_prime(7				)				)
      self.assertTrue(is_prime(1_1				)				)
      self.assertTrue(is_prime(1_3				)				)
      self.assertTrue(is_prime(1_7				)				)
      self.assertTrue(is_prime(1_9				)				)
      self.assertTrue(is_prime(2_3				)				)
      self.assertTrue(is_prime(2_9				)				)






     def 	__snake_case    (       self :							List[str]				)->List[Any]:
      with self.assertRaises(UpperCamelCase				):
       is_prime(-1_9				)
      self.assertFalse(
          is_prime(0				)     ,  "Zero doesn't have any positive factors, primes must have exactly two."     ,  )
      self.assertFalse(
          is_prime(1				)     ,  "One only has 1 positive factor, primes must have exactly two."     ,  )
      self.assertFalse(is_prime(2 * 2				)				)
      self.assertFalse(is_prime(2 * 3				)				)
      self.assertFalse(is_prime(3 * 3				)				)
      self.assertFalse(is_prime(3 * 5				)				)
      self.assertFalse(is_prime(3 * 5 * 7				)				)


if __name__ == "__main__":
      unittest.main()











from math import sqrt






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int     ):



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






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int = 10001     ):



 """simple docstring"""





 __SCREAMING_SNAKE_CASE       :    List[Any]       =	0
 __SCREAMING_SNAKE_CASE       :    Dict       =	1
 while count != nth and number < 3:
  number += 1
  if is_prime(__lowerCamelCase     ):
   count += 1
 while count != nth:
  number += 2
  if is_prime(__lowerCamelCase     ):
   count += 1
 return number


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






