




'''simple docstring'''


def 						SCREAMING_SNAKE_CASE       (      a_	:							list			):

  if len(lowerCAmelCase__			) < 2:
    return collection

  def circle_sort_util(a_	:							list				,					a_	:							int				,					a_	:							int			) -> bool:
    __a			=					False

    if low == high:
      return swapped

    __a			=					low
    __a			=					high

    while left < right:
      if collection[left] > collection[right]:
        __a	,       __a			=					(
            collection[right],
            collection[left],
        )
        __a			=					True

      left += 1
      right -= 1

    if left == right and collection[left] > collection[right + 1]:
      __a	,       __a			=					(
          collection[right + 1],
          collection[left],
      )

      __a			=					True

    __a			=					low + int((high - low) / 2			)
    __a			=					circle_sort_util(lowerCAmelCase__				,					lowerCAmelCase__				,					lowerCAmelCase__			)
    __a			=					circle_sort_util(lowerCAmelCase__				,					mid + 1				,					lowerCAmelCase__			)

    return swapped or left_swap or right_swap

  __a			=					True

  while is_not_sorted is True:
    __a			=					circle_sort_util(lowerCAmelCase__				,					0				,					len(lowerCAmelCase__			) - 1			)

  return collection


if __name__ == "__main__":
  UpperCAmelCase_ 		=      input("Enter numbers separated by a comma:\n").strip()
  UpperCAmelCase_ 		=      [int(item) for item in user_input.split(",")]
  print(circle_sort(unsorted))









'''simple docstring'''


def 						SCREAMING_SNAKE_CASE       (      a_	:							int				,					a_	:							int			):
  return int((input_a, input_a).count(0			) != 0			)


def 						SCREAMING_SNAKE_CASE       (      ):
  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))



