
'''simple docstring'''







def        SCREAMING_SNAKE_CASE__			(     __A=28_123			) ->			List[str]:
	_snake_case     		=	[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

	_snake_case     		=	set()
	_snake_case     		=	0

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

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

	return res


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



'''simple docstring'''







from __future__ import annotations







def        SCREAMING_SNAKE_CASE__			(     __A			) ->			int:
	if not nums:
		return 0
	_snake_case     		=	nums[0]
	_snake_case     		=	0
	for num in nums[1:]:
		_snake_case		,				_snake_case     		=	(
		    max_excluding + num,
		    max(__A    ,       __A			),
		)
	return max(__A    ,       __A			)


if __name__ == "__main__":
					import doctest

					doctest.testmod()

