

def 					lowerCamelCase_     (							UpperCAmelCase_							:     int=2_8_1_2_3	)						->				Optional[Any]:




	'''simple docstring'''




	_UpperCamelCase   :		Tuple			=						[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[Any]			=						set()
	_UpperCamelCase   :		Tuple			=						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())







from .glue import glue_convert_examples_to_features, glue_output_modes, glue_processors, glue_tasks_num_labels
from .squad import SquadExample, SquadFeatures, SquadVaProcessor, SquadVaProcessor, squad_convert_examples_to_features
from .utils import DataProcessor, InputExample, InputFeatures, SingleSentenceClassificationProcessor
from .xnli import xnli_output_modes, xnli_processors, xnli_tasks_num_labels




