


def 	_lowerCAmelCase       (    _lowerCAmelCase=2_8123 )						->	List[str]:


						'''simple docstring'''






						__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(_lowerCAmelCase )

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

						return res


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









from __future__ import annotations





def 	_lowerCAmelCase       (    _lowerCAmelCase )						->	list:


						'''simple docstring'''






						if len(_lowerCAmelCase ) == 0:
												return []
						__snake_case		,					__snake_case				=		min(_lowerCAmelCase ), max(_lowerCAmelCase )
						__snake_case				=		int(max_value - min_value ) + 1
						__snake_case				=		[[] for _ in range(_lowerCAmelCase )]

						for i in my_list:
												buckets[int(i - min_value )].append(_lowerCAmelCase )

						return [v for bucket in buckets for v in sorted(_lowerCAmelCase )]


if __name__ == "__main__":
	from doctest import testmod

	testmod()
	assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
	assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





