






'''simple docstring'''




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						(  lowerCamelCase_     ,      lowerCamelCase_)							->     list[str]:
		return [sentence[i : i + ngram_size] for i in range(len(lowerCamelCase_) - ngram_size + 1)]


if __name__ == "__main__":
		from doctest import testmod

		testmod()




