



'''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]








'''simple docstring'''





from __future__ import annotations




def lowerCAmelCase    (__A):



     """simple docstring"""



     _a           =    2
     _a           =    []
     while i * i <= n:
          if n % i:
               i += 1
          else:
               n //= i
               factors.append(__A)
     if n > 1:
          factors.append(__A)
     return factors


if __name__ == "__main__":
  import doctest

  doctest.testmod()



