





def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :Union[str, Any]=2_8123     )      ->						Dict:
  _lowercase							= [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

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






from __future__ import annotations

from collections.abc import Generator

def 							SCREAMING_SNAKE_CASE__       (  )      ->						Generator[int, None, None]:
  _lowercase							= {}
  _lowercase							= 2
  while True:
    _lowercase							= factor_map.pop(snake_case__			,							snake_case__     )
    if factor:
      _lowercase							= factor + prime
      while x in factor_map:
        x += factor
      _lowercase							= factor
    else:
      _lowercase							= prime
      yield prime
    prime += 1

def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :float = 1E10     )      ->						int:
  _lowercase							= sieve()

  _lowercase							= 1
  while True:
    _lowercase							= next(snake_case__     )
    if (2 * prime * n) > limit:
      return n
    # Ignore the next prime as the reminder will be 2.
    next(snake_case__     )
    n += 2


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