'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					list )			->      list:
							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]






'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					list )			->      list:
							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]





