

from __future__ import annotations

import math

def        lowerCamelCase__       (    _a):

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


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

def        lowerCamelCase__       (    _a):
	if not isinstance(_a							,	_a):
		raise ValueError("n must be an integer")
	if n <= 0:
		raise ValueError("n must be >= 0")

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

	return []

def        lowerCamelCase__       (    ):
	return compute_nums(1)[0]


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







"""simple docstring"""
lowerCamelCase_					=      [
    (1000, '''M'''),
    (900, '''CM'''),
    (500, '''D'''),
    (400, '''CD'''),
    (100, '''C'''),
    (90, '''XC'''),
    (50, '''L'''),
    (40, '''XL'''),
    (10, '''X'''),
    (9, '''IX'''),
    (5, '''V'''),
    (4, '''IV'''),
    (1, '''I'''),
]

def 				snake_case      (   A__						):
			UpperCAmelCase_     : List[str]			     =					{"I": 1, "V": 5, "X": 10, "L": 50, "C": 1_00, "D": 5_00, "M": 10_00}
			UpperCAmelCase_     : Optional[Any]			     =					0
			UpperCAmelCase_     : Tuple			     =					0
			while place < len(A__						):
						if (place + 1 < len(A__						)) and (vals[roman[place]] < vals[roman[place + 1]]):
									total += vals[roman[place + 1]] - vals[roman[place]]
									place += 2
						else:
									total += vals[roman[place]]
									place += 1
			return total

def 				snake_case      (   A__						):
			UpperCAmelCase_     : Union[str, Any]			     =					[]
			for arabic, roman in ROMAN:
						((UpperCAmelCase_)     ,	(UpperCAmelCase_))     : str			     =					divmod(A__	,A__						)
						result.append(roman * factor						)
						if number == 0:
									break
			return "".join(A__						)


if __name__ == "__main__":
			import doctest

			doctest.testmod()



