






def    a_       (					_A=28123     )	->	int:







				"""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(snake_case_     )

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

				return res


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











def lowerCamelCase__    (							)      ->				int:
   return [
       a * b * (1000 - a - b)
       for a in range(1       ,      999       )
       for b in range(snake_case_       ,      999       )
       if (a * a + b * b == (1000 - a - b) ** 2)
   ][0]


if __name__ == "__main__":
    print(F'{solution() = }')

