





from __future__ import annotations

import math


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__						):

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


_lowercase		:  Optional[int]			       =[num for num in range(3, 10_0001, 2) if not is_prime(num)]


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

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

		return []


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


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







def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__=2_81_23						):
		lowerCamelCase_	:     Any 						=      [1] * (limit + 1)

		for i in range(2							,int(limit**0.5						) + 1						):
				sum_divs[i * i] += i
				for k in range(i + 1							,limit // i + 1						):
						sum_divs[k * i] += k + i

		lowerCamelCase_	:     List[str] 						=      set()
		lowerCamelCase_	:     List[str] 						=      0

		for n in range(1							,limit + 1						):
				if sum_divs[n] > n:
						abundants.add(lowerCAmelCase__						)

				if not any((n - a in abundants) for a in abundants						):
						res += n

		return res


if __name__ == "__main__":
		print(solution())
