


'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   List[str]=2_81_23					):
  '''simple docstring'''





  lowerCAmelCase_			:      Optional[int]			=   [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

  lowerCAmelCase_			:      Union[str, Any]			=   set()
  lowerCAmelCase_			:      Any			=   0

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

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

  return res


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







'''simple docstring'''






from __future__ import annotations

from typing import Any






class    __snake_case       (   _SCREAMING_SNAKE_CASE):







    """simple docstring"""



    pass







class    __snake_case       :







    """simple docstring"""



    def __init__(   self    :  Union[str, Any]    ,						lowerCamelCase    :  Any		)   ->  None:
      lowerCAmelCase_			:      Any			=   data
      lowerCAmelCase_			:      Node | None			=   None

    def __iter__(   self    :  Union[str, Any]		)   ->  Optional[Any]:
      lowerCAmelCase_			:      Union[str, Any]			=   self
      lowerCAmelCase_			:      Any			=   []
      while node:
        if node in visited:
          raise ContainsLoopError
        visited.append(lowerCamelCase		)
        yield node.data
        lowerCAmelCase_			:      int			=   node.next_node





    @property
    def __lowercase   (   self    :  str		)   ->  bool:
      try:
        list(self		)
        return False
      except ContainsLoopError:
        return True


if __name__ == "__main__":
  __A					:  Dict											=      Node(1)
  __A					:  Optional[Any]											=      Node(2)
  __A					:  int											=      Node(3)
  __A					:  Optional[Any]											=      Node(4)
  print(root_node.has_loop)  # False
  __A					:  Any											=      root_node.next_node
  print(root_node.has_loop)  # True

  __A					:  List[Any]											=      Node(5)
  __A					:  Dict											=      Node(6)
  __A					:  str											=      Node(5)
  __A					:  Dict											=      Node(6)
  print(root_node.has_loop)  # False

  __A					:  Optional[int]											=      Node(1)
  print(root_node.has_loop)  # False



