






def 				snake_case  (     lowerCamelCase=28_123					):




				'''simple docstring'''







				__lowercase             =  [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

				__lowercase             =  set()
				__lowercase             =  0

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

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

				return res


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









from math import sqrt





def 				snake_case  (     lowerCamelCase					):




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





def 				snake_case  (     lowerCamelCase = 10_001					):




	'''simple docstring'''







	__lowercase             =  0
	__lowercase             =  1
	while count != nth and number < 3:
		number += 1
		if is_prime(lowerCamelCase					):
			count += 1
	while count != nth:
		number += 2
		if is_prime(lowerCamelCase					):
			count += 1
	return number


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

