

'''simple docstring'''
def  _A		(     snake_case       )      ->     list:
   if any(not isinstance(snake_case		,							snake_case       ) or x < 0 for x in sequence       ):
      raise TypeError("Sequence must be list of non-negative integers"       )
   for _ in range(len(snake_case       )       ):
      for i, (rod_upper, rod_lower) in enumerate(zip(snake_case		,							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  _A		(     snake_case		,							snake_case					)      ->     int:
   return int((input_a, input_a).count(0					) != 0					)







def  _A		(     )      ->     None:
   assert nand_gate(0		,							0					) == 1
   assert nand_gate(0		,							1					) == 1
   assert nand_gate(1		,							0					) == 1
   assert nand_gate(1		,							1					) == 0


if __name__ == "__main__":
    print(nand_gate(0, 0))
    print(nand_gate(0, 1))
    print(nand_gate(1, 0))
    print(nand_gate(1, 1))






