



from __future__ import annotations

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			list    ):
				"""simple docstring"""







				if len(_SCREAMING_SNAKE_CASE    ) == 0:
								return []
				__a     ,					__a       =		min(_SCREAMING_SNAKE_CASE    ), max(_SCREAMING_SNAKE_CASE    )
				__a       =		int(max_value - min_value    ) + 1
				__a       =		[[] for _ in range(_SCREAMING_SNAKE_CASE    )]

				for i in my_list:
								buckets[int(i - min_value    )].append(_SCREAMING_SNAKE_CASE    )

				return [v for bucket in buckets for v in sorted(_SCREAMING_SNAKE_CASE    )]


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

						testmod()
						assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
						assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





from math import sqrt

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

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int = 1_0001    ):
				"""simple docstring"""







				__a       =		0
				__a       =		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() = }""")
