


'''simple docstring'''





from __future__ import annotations

import math


def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







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


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


def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







			if not isinstance(_SCREAMING_SNAKE_CASE       ,			_SCREAMING_SNAKE_CASE  ):
						raise ValueError('''n must be an integer'''  )
			if n <= 0:
						raise ValueError('''n must be >= 0'''  )

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

			return []


def 		lowercase_  (     ):


			'''simple docstring'''







			return compute_nums(1  )[0]


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






from itertools import count


def 		lowercase_  (     _UpperCamelCase = 50  ):


			'''simple docstring'''







			__lowercase 					=   [1] * min_block_length

			for n in count(_UpperCamelCase  ):
						fill_count_functions.append(1  )

						for block_length in range(_UpperCamelCase       ,			n + 1  ):
									for block_start in range(n - block_length  ):
												fill_count_functions[n] += fill_count_functions[
												    n - block_start - block_length - 1
												]

									fill_count_functions[n] += 1

						if fill_count_functions[n] > 1_00_00_00:
									break

			return n


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


