
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]





from math import loga





def 						SCREAMING_SNAKE_CASE__     (   __lowerCAmelCase				):
    if a < 0:
        raise ValueError("Input value must be a positive integer"				)
    elif isinstance(__lowerCAmelCase     ,		__lowerCAmelCase				):
        raise TypeError("Input value must be a 'int' type"				)
    return 0 if (a == 0) else int(loga(a & -a				)				)


if __name__ == "__main__":
     import doctest

     doctest.testmod()



