




"""simple docstring"""



from __future__ import annotations

import math







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


SCREAMING_SNAKE_CASE				=       [num for num in range(3, 10_0001, 2) if not is_prime(num)]







def   _SCREAMING_SNAKE_CASE   (							lowercase_						)						->		list[int]:
 if not isinstance(UpperCAmelCase__			, UpperCAmelCase__						):
  raise ValueError("n must be an integer"						)
 if n <= 0:
  raise ValueError("n must be >= 0"						)

 A__       =				[]
 for num in range(len(UpperCAmelCase__						)						):
  A__       =				0
  while 2 * i * i <= odd_composites[num]:
   A__       =				odd_composites[num] - 2 * i * i
   if is_prime(UpperCAmelCase__						):
    break
   i += 1
  else:
   list_nums.append(odd_composites[num]						)
   if len(UpperCAmelCase__						) == n:
    return list_nums

 return []







def   _SCREAMING_SNAKE_CASE   (							)						->		int:
 return compute_nums(1						)[0]


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






'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					list )			->      list:
							if any(not isinstance(UpperCAmelCase__      ,      UpperCAmelCase__ ) or x < 0 for x in sequence ):
														raise TypeError("""Sequence must be list of non-negative integers""" )
							for _ in range(len(UpperCAmelCase__ ) ):
														for i, (rod_upper, rod_lower) in enumerate(zip(UpperCAmelCase__      ,      sequence[1:] ) ):
																					if rod_upper > rod_lower:
																												sequence[i] -= rod_upper - rod_lower
																												sequence[i + 1] += rod_upper - rod_lower
							return sequence


if __name__ == "__main__":
						assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
						assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]





