



'''simple docstring'''





def lowerCAmelCase    (__A):



     """simple docstring"""



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






def 							__SCREAMING_SNAKE_CASE     (   a__    :   int       )					->				int:
	if not isinstance(a__			,a__       ):
		raise TypeError("""Input value must be an 'int' type"""       )

	__A :			Union[str, Any]		    =			0
	while number:
		position += 1
		number >>= 1

	return position


if __name__ == "__main__":
			import doctest

			doctest.testmod()





