
def a__       (			A_=28123   ):






  '''simple docstring'''





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

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



import math

def a__       (			A_   ):






  '''simple docstring'''





  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5,	int(math.sqrt(A_   ) + 1   ),	6   ):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True

def a__       (			A_ = 0.1   ):






  '''simple docstring'''





  __magic_name__								=			3
  __magic_name__								=			3

  while primes / (2 * j - 1) >= ratio:
    for i in range(j * j + j + 1,	(j + 2) * (j + 2),	j + 1   ):
      primes += is_prime(A_   )
    j += 2
  return j


if __name__ == "__main__":
    import doctest

    doctest.testmod()

