



'''simple docstring'''





def lowerCAmelCase						(__A=28_123):



     """simple docstring"""



     _a											=						[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

     _a											=						set()
     _a											=						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

import math




def lowerCAmelCase						(__A						,			__A						,			__A						,			__A						,			__A):



     """simple docstring"""



     if depth < 0:
          raise ValueError('''Depth cannot be less than 0''')

     if not scores:
          raise ValueError('''Scores cannot be empty''')

     if depth == height:
          return scores[node_index]

     return (
         max(
             minimax(depth + 1						,			node_index * 2						,			__A						,			__A						,			__A)						,			minimax(depth + 1						,			node_index * 2 + 1						,			__A						,			__A						,			__A)						,			)
         if is_max
         else min(
             minimax(depth + 1						,			node_index * 2						,			__A						,			__A						,			__A)						,			minimax(depth + 1						,			node_index * 2 + 1						,			__A						,			__A						,			__A)						,			)
     )




def lowerCAmelCase						():



     """simple docstring"""



     _a											=						[90, 23, 6, 33, 21, 65, 123, 34_423]
     _a											=						math.log(len(__A)						,			2)
     print(F'''Optimal value : {minimax(0						,			0						,			__A						,			__A						,			__A)}''')


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()



