





from __future__ import annotations

import math





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


A_												=     [num for num in range(3, 1_0_0_0_0_1, 2) if not is_prime(num)]





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

					lowerCamelCase__       =       []
					for num in range(len(a)):
										lowerCamelCase__       =       0
										while 2 * i * i <= odd_composites[num]:
															lowerCamelCase__       =       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    __UpperCamelCase      (    ) ->int:
					return compute_nums(1)[0]


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








def    __UpperCamelCase      (    a = 100) ->int:
					lowerCamelCase__       =       (n * (n + 1) // 2) ** 2
					lowerCamelCase__       =       n * (n + 1) * (2 * n + 1) // 6
					return sum_cubes - sum_squares


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

