

"""simple docstring"""






def 	lowercase      (   __UpperCamelCase=28123						) ->      Optional[int]:
 __magic_name__     =      [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

 __magic_name__     =      set()
 __magic_name__     =      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 collections.abc import Sequence
from queue import Queue
class        _lowercase					:







     def __init__(      self ,						UpperCamelCase_ ,						UpperCamelCase_ ,						UpperCamelCase_ ,						UpperCamelCase_=None ,						UpperCamelCase_=None       ):
      __magic_name__     =      start
      __magic_name__     =      end
      __magic_name__     =      val
      __magic_name__     =      (start + end) // 2
      __magic_name__     =      left
      __magic_name__     =      right







     def __repr__(      self       ):
      return f'''SegmentTreeNode(start={self.start}, end={self.end}, val={self.val})'''


class        _lowercase					:







     def __init__(      self ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      __magic_name__     =      collection
      __magic_name__     =      function
      if self.collection:
       __magic_name__     =      self._build_tree(0 ,						len(UpperCamelCase_       ) - 1       )







     def 	lowerCAmelCase__    (      self ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      self._update_tree(self.root ,						UpperCamelCase_ ,						UpperCamelCase_       )







     def 	lowerCAmelCase__    (      self ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      return self._query_range(self.root ,						UpperCamelCase_ ,						UpperCamelCase_       )







     def 	lowerCAmelCase__    (      self ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      if start == end:
       return SegmentTreeNode(UpperCamelCase_ ,						UpperCamelCase_ ,						self.collection[start]       )
      __magic_name__     =      (start + end) // 2
      __magic_name__     =      self._build_tree(UpperCamelCase_ ,						UpperCamelCase_       )
      __magic_name__     =      self._build_tree(mid + 1 ,						UpperCamelCase_       )
      return SegmentTreeNode(UpperCamelCase_ ,						UpperCamelCase_ ,						self.fn(left.val ,						right.val       ) ,						UpperCamelCase_ ,						UpperCamelCase_       )







     def 	lowerCAmelCase__    (      self ,						UpperCamelCase_ ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      if node.start == i and node.end == i:
       __magic_name__     =      val
       return
      if i <= node.mid:
       self._update_tree(node.left ,						UpperCamelCase_ ,						UpperCamelCase_       )
      else:
       self._update_tree(node.right ,						UpperCamelCase_ ,						UpperCamelCase_       )
      __magic_name__     =      self.fn(node.left.val ,						node.right.val       )







     def 	lowerCAmelCase__    (      self ,						UpperCamelCase_ ,						UpperCamelCase_ ,						UpperCamelCase_       ):
      if node.start == i and node.end == j:
       return node.val

      if i <= node.mid:
       if j <= node.mid:
        # range in left child tree
        return self._query_range(node.left ,						UpperCamelCase_ ,						UpperCamelCase_       )
       else:
        # range in left child tree and right child tree
        return self.fn(
            self._query_range(node.left ,						UpperCamelCase_ ,						node.mid       ) ,						self._query_range(node.right ,						node.mid + 1 ,						UpperCamelCase_       ) ,						)
      else:
       # range in right child tree
       return self._query_range(node.right ,						UpperCamelCase_ ,						UpperCamelCase_       )







     def 	lowerCAmelCase__    (      self       ):
      if self.root is not None:
       __magic_name__     =      Queue()
       queue.put(self.root       )
       while not queue.empty():
        __magic_name__     =      queue.get()
        yield node

        if node.left is not None:
         queue.put(node.left       )

        if node.right is not None:
         queue.put(node.right       )


if __name__ == "__main__":
 import operator

 for fn in [operator.add, max, min]:
  print("*" * 50)
  __lowerCamelCase										=		SegmentTree([2, 1, 5, 3, 4], fn)
  for node in arr.traverse():
   print(node)
  print()

  arr.update(1, 5)
  for node in arr.traverse():
   print(node)
  print()

  print(arr.query_range(3, 4))  # 7
  print(arr.query_range(2, 2))  # 5
  print(arr.query_range(1, 3))  # 13
  print()

