def 				__lowerCamelCase		(						lowerCAmelCase__=2_8_1_2_3     ):
       lowerCAmelCase__					     = [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__					     = set()
       lowerCAmelCase__					     = 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())

import numpy as np






def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       return 1 / (1 + np.exp(-vector     ))






def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       return vector * sigmoid(lowerCAmelCase__     )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
