def 	__lowerCamelCase							(UpperCAmelCase__     :							Dict      , UpperCAmelCase__     :							str  ):
					# "extended trapezoidal rule"
					# int(f) = dx/2 * (f1 + 2f2 + ... + fn)
					SCREAMING_SNAKE_CASE    			=       (boundary[1] - boundary[0]) / steps
					SCREAMING_SNAKE_CASE    			=       boundary[0]
					SCREAMING_SNAKE_CASE    			=       boundary[1]
					SCREAMING_SNAKE_CASE    			=       make_points(UpperCAmelCase__      , UpperCAmelCase__      , UpperCAmelCase__  )
					SCREAMING_SNAKE_CASE    			=       0.0
					y += (h / 2.0) * f(UpperCAmelCase__  )
					for i in x_i:
										# print(i)
										y += h * f(UpperCAmelCase__  )
					y += (h / 2.0) * f(UpperCAmelCase__  )
					return y





def 	__lowerCamelCase							(UpperCAmelCase__     :							List[Any]      , UpperCAmelCase__     :							Dict      , UpperCAmelCase__     :							Tuple  ):
					SCREAMING_SNAKE_CASE    			=       a + h
					while x < (b - h):
										yield x
										SCREAMING_SNAKE_CASE    			=       x + h





def 	__lowerCamelCase							(UpperCAmelCase__     :							Any  ):  # enter your function here
					SCREAMING_SNAKE_CASE    			=       (x - 0) * (x - 0)
					return y





def 	__lowerCamelCase							():
					SCREAMING_SNAKE_CASE    			=       0.0  # Lower bound of integration
					SCREAMING_SNAKE_CASE    			=       1.0  # Upper bound of integration
					SCREAMING_SNAKE_CASE    			=       10.0  # define number of steps or resolution
					SCREAMING_SNAKE_CASE    			=       [a, b]  # define boundary of integration
					SCREAMING_SNAKE_CASE    			=       method_a(UpperCAmelCase__      , UpperCAmelCase__  )
					print(F"y = {y}"  )


if __name__ == "__main__":
							main()





from __future__ import annotations

import math





def 	__lowerCamelCase							(UpperCAmelCase__     :							int  ):

					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


_lowerCamelCase					:   Tuple							=		[num for num in range(3, 10_00_01, 2) if not is_prime(num)]





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

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


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




