






def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	if any(not isinstance(__UpperCamelCase				,  __UpperCamelCase					) or x < 0 for x in sequence					):
		raise TypeError("""Sequence must be list of non-negative integers"""					)
	for _ in range(len(__UpperCamelCase					)					):
		for i, (rod_upper, rod_lower) in enumerate(zip(__UpperCamelCase				,  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]












from __future__ import annotations





def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	if len(lowerCamelCase					) < 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"""					)
	__lowercase             =  nums.copy()
	copy_nums.sort()
	return copy_nums[-1] < sum(copy_nums[:-1]					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()

