

from __future__ import annotations

import math






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


a		=[num for num in range(3, 100001, 2) if not is_prime(num)]






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__      )  ->					list[int]:
	if not isinstance(lowerCamelCase__     ,			lowerCamelCase__      ):
		raise ValueError('n must be an integer'      )
	if n <= 0:
		raise ValueError('n must be >= 0'      )

	__lowerCamelCase    :    Any 	=			[]
	for num in range(len(lowerCamelCase__      )      ):
		__lowerCamelCase    :    List[str] 	=			0
		while 2 * i * i <= odd_composites[num]:
			__lowerCamelCase    :    Tuple 	=			odd_composites[num] - 2 * i * i
			if is_prime(lowerCamelCase__      ):
				break
			i += 1
		else:
			list_nums.append(odd_composites[num]      )
			if len(lowerCamelCase__      ) == n:
				return list_nums

	return []






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


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







# This is the module that test_patching.py uses to test patch_submodule()

import os  # noqa: this is just for tests
import os as renamed_os  # noqa: this is just for tests
from os import path  # noqa: this is just for tests
from os import path as renamed_path  # noqa: this is just for tests
from os.path import join  # noqa: this is just for tests
from os.path import join as renamed_join  # noqa: this is just for tests


a		=open  # noqa: we just need to have a builtin inside this module to test it properly




