
from __future__ import annotations

from collections.abc import Iterator
from typing import Generic, TypeVar

__magic_name__  							=	TypeVar('''T''')




class        _SCREAMING_SNAKE_CASE	(   Generic[T]			):
      def __init__(      self		,						lowerCamelCase			):
          snake_case__    =					data
          snake_case__    =					None



      def __str__(      self			):
          return F"""{self.data}"""





class        _SCREAMING_SNAKE_CASE	(   Generic[T]			):
      def __init__(      self			):
          snake_case__    =					None
      def __iter__(      self			):
          snake_case__    =					self.top
          while node:
              yield node.data
              snake_case__    =					node.next
      def __str__(      self			):
          return "->".join([str(lowerCamelCase			) for item in self]			)
      def __len__(      self			):
          return len(tuple(iter(self			)			)			)
      def A_      (      self			):
          return self.top is None
      def A_      (      self		,						lowerCamelCase			):
          snake_case__    =					Node(lowerCamelCase			)
          if not self.is_empty():
              snake_case__    =					self.top
          snake_case__    =					node
      def A_      (      self			):
          if self.is_empty():
              raise IndexError("pop from empty stack"			)
          assert isinstance(self.top		,						lowerCamelCase			)
          snake_case__    =					self.top
          snake_case__    =					self.top.next
          return pop_node.data
      def A_      (      self			):
          if self.is_empty():
              raise IndexError("peek from empty stack"			)

          assert self.top is not None
          return self.top.data



      def A_      (      self			):
          snake_case__    =					None


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

     testmod()





def 						SCREAMING_SNAKE_CASE__     (   __lowerCAmelCase				):
    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]



