




'''simple docstring'''

def __UpperCAmelCase	(   _UpperCAmelCase		:   List[Any]=2_81_23						)      ->      str:
			__snake_case			=		[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			=		set()
			__snake_case			=		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())










from __future__ import annotations





def 		a__      (		_UpperCamelCase      :			list[float]				):
   if len(_UpperCamelCase				) < 2:
      raise ValueError('''Monogons and Digons are not polygons in the Euclidean space'''				)
   if any(i <= 0 for i in nums				):
      raise ValueError('''All values must be greater than 0'''				)
   __lowerCamelCase    				=     nums.copy()
   copy_nums.sort()
   return copy_nums[-1] < sum(copy_nums[:-1]				)


if __name__ == "__main__":
  import doctest

  doctest.testmod()






