
def 			UpperCamelCase					(    __lowerCamelCase     : list    ):
       if any(not isinstance(__lowerCamelCase				,					__lowerCamelCase    ) or x < 0 for x in sequence    ):
              raise TypeError("Sequence must be list of non-negative integers"    )
       for _ in range(len(__lowerCamelCase    )    ):
              for i, (rod_upper, rod_lower) in enumerate(zip(__lowerCamelCase				,					sequence[1:]    )    ):
                     if rod_upper > rod_lower:
                            sequence[i] -= rod_upper - rod_lower
                            sequence[i + 1] += rod_upper - rod_lower
       return sequence


if __name__ == "__main__":
   assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
   assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]






'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __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(snake_case_      )

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

 return res


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






