




'''simple docstring'''

def __UpperCAmelCase	(   _UpperCAmelCase		:   List[Any]=2_81_23						)      ->      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(_UpperCAmelCase						)

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

			return res


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








def 			_A	(      SCREAMING_SNAKE_CASE      ):
	UpperCAmelCase__:	Tuple									= int(SCREAMING_SNAKE_CASE      )
	if decimal in (0, 1):  # Exit cases for the recursion
		return str(SCREAMING_SNAKE_CASE      )
	UpperCAmelCase__							,						UpperCAmelCase__:	Union[str, Any]									= divmod(SCREAMING_SNAKE_CASE	,2      )
	return binary_recursive(SCREAMING_SNAKE_CASE      ) + str(SCREAMING_SNAKE_CASE      )



def 			_A	(      SCREAMING_SNAKE_CASE      ):
	UpperCAmelCase__:	List[str]									= str(SCREAMING_SNAKE_CASE      ).strip()
	if not number:
		raise ValueError("No input value was provided"      )
	UpperCAmelCase__:	Tuple									= "-" if number.startswith("-"      ) else ""
	UpperCAmelCase__:	Any									= number.lstrip("-"      )
	if not number.isnumeric():
		raise ValueError("Input value is not an integer"      )
	return f"{negative}0b{binary_recursive(int(SCREAMING_SNAKE_CASE      )      )}"


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

					testmod()