



from __future__ import annotations

from cmath import sqrt







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int   ,   SCREAMING_SNAKE_CASE_							:       int   ,   SCREAMING_SNAKE_CASE_							:       int  ):

					if a == 0:
										raise ValueError("Coefficient 'a' must not be zero."  )
					__lowerCAmelCase            = b * b - 4 * a * c

					__lowerCAmelCase            = (-b + sqrt(SCREAMING_SNAKE_CASE_  )) / (2 * a)
					__lowerCAmelCase            = (-b - sqrt(SCREAMING_SNAKE_CASE_  )) / (2 * a)

					return (
					    root_a.real if not root_a.imag else root_a,
					    root_a.real if not root_a.imag else root_a,
					)







def 			_a   (		):
					__lowerCAmelCase     ,							__lowerCAmelCase            = quadratic_roots(a=5   ,   b=6   ,   c=1  )
					print(F"""The solutions are: {solutiona} and {solutiona}"""  )


if __name__ == "__main__":
					main()










from math import sqrt







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int  ):

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







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int = 1_00_01  ):
					__lowerCAmelCase            = 0
					__lowerCAmelCase            = 1
					while count != nth and number < 3:
										number += 1
										if is_prime(SCREAMING_SNAKE_CASE_  ):
															count += 1
					while count != nth:
										number += 2
										if is_prime(SCREAMING_SNAKE_CASE_  ):
															count += 1
					return number


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




