
"""simple docstring"""



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

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

  return res


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





"""simple docstring"""



def 					_UpperCAmelCase      ( __lowerCamelCase   :       int = 1_00_00_00		)     ->					int:
  _snake_case					     =       limit + 1
  _snake_case					     =       [0] * limit
  for first_term in range(1 ,					__lowerCamelCase		):
    for n in range(__lowerCamelCase ,					__lowerCamelCase ,					__lowerCamelCase		):
      _snake_case					     =       first_term + n / first_term
      if common_difference % 4:  # d must be divisble by 4
        continue
      else:
        common_difference /= 4
        if (
            first_term > common_difference
            and first_term < 4 * common_difference
        ):  # since x,y,z are positive integers
          frequency[n] += 1  # so z>0 and a>d ,also 4d<a

  _snake_case					     =       sum(1 for x in frequency[1:limit] if x == 10		)

  return count


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



