def        SCREAMING_SNAKE_CASE_      (		lowerCAmelCase_:			Tuple=2_8_1_2_3  ):
      snake_case_  :      Tuple  	=							[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_  :      str  	=							set()
      snake_case_  :      str  	=							0

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

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

      return res


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







'''simple docstring'''
def 					lowerCamelCase_ ( __UpperCamelCase					:       int		)					->	bool:







     """simple docstring"""
     if num < 0:
          return False

     _A				=							num
     _A				=							0
     while num > 0:
          _A				=							rev_num * 1_0 + (num % 1_0)
          num //= 1_0

     return num_copy == rev_num


if __name__ == "__main__":
    import doctest

    doctest.testmod()





