

"""simple docstring"""






def   lowercase_	(    _lowercase       :		Any=2_81_23	):




					'''simple docstring'''






					UpperCAmelCase			:   List[str]      =				[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

					UpperCAmelCase			:   List[str]      =				set()
					UpperCAmelCase			:   Optional[int]      =				0

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

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

					return res


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





"""simple docstring"""






def   lowercase_	(    _lowercase       :		list							,      _lowercase       :		int							,      _lowercase       :		int = 0							,      _lowercase       :		int = 0	):




					'''simple docstring'''






					UpperCAmelCase			:   Tuple      =				right or len(_lowercase	) - 1
					if left > right:
										return -1
					elif list_data[left] == key:
										return left
					elif list_data[right] == key:
										return right
					else:
										return search(_lowercase							,      _lowercase							,      left + 1							,      right - 1	)


if __name__ == "__main__":
	import doctest

	doctest.testmod()


