from __future__ import annotations

import math
def 					_snake_case	(  __snake_case						):

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


_lowerCAmelCase       =		[num for num in range(3, 100_001, 2) if not is_prime(num)]
def 					_snake_case	(  __snake_case						):
					if not isinstance(__snake_case  ,     __snake_case						):
										raise ValueError('''n must be an integer'''						)
					if n <= 0:
										raise ValueError('''n must be >= 0'''						)

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

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


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








"""simple docstring"""
def 				lowercase__		(					lowerCamelCase,						lowerCamelCase       ):
				return abs(lowerCamelCase       ) if a == 0 else greatest_common_divisor(b % a,						lowerCamelCase       )





def 				lowercase__		(					lowerCamelCase,						lowerCamelCase       ):
				while y:  # --> when y=0 then loop will terminate and return x as final GCD.
								_SCREAMING_SNAKE_CASE		,						_SCREAMING_SNAKE_CASE   :		Optional[Any]       		=    y, x % y
				return abs(lowerCamelCase       )





def 				lowercase__		(					):
				try:
								_SCREAMING_SNAKE_CASE   :		Union[str, Any]       		=    input('Enter two integers separated by comma (,): '       ).split(','       )
								_SCREAMING_SNAKE_CASE   :		Dict       		=    int(nums[0]       )
								_SCREAMING_SNAKE_CASE   :		Dict       		=    int(nums[1]       )
								print(
								    f"""greatest_common_divisor({num_a}, {num_a}) = """
								    f"""{greatest_common_divisor(lowerCamelCase,						lowerCamelCase       )}"""       )
								print(f"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(lowerCamelCase,						lowerCamelCase       )}"""       )
				except (IndexError, UnboundLocalError, ValueError):
								print('Wrong input'       )


if __name__ == "__main__":
			main()

