def 			A__      (	snake_case_ :		Tuple=28_123      ):
 SCREAMING_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

 SCREAMING_SNAKE_CASE__:   Tuple=      set()
 SCREAMING_SNAKE_CASE__:   List[Any]=      0

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

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

 return res


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


import re







def 			A__      (	snake_case_ :		str      ):

 if len(re.findall('''[ATCG]'''       ,				snake_case_      )      ) != len(snake_case_      ):
  raise ValueError('''Invalid Strand'''      )

 return dna.translate(dna.maketrans('''ATCG'''       ,				'''TAGC'''      )      )


if __name__ == "__main__":
      import doctest

      doctest.testmod()

