


'''simple docstring'''




from __future__ import annotations





def      _a		(lowercase__ :      str       ,      lowercase__ :      Union[str, Any]	) -> List[Any]:






     """simple docstring"""
     __snake_case    			=	0
     __snake_case    			=	len(lowercase__	) - 1
     while left <= right:
          __snake_case    			=	(left + right) // 2
          if left == right:
               if sorted_list[middle] < item:
                    __snake_case    			=	middle + 1
               break
          elif sorted_list[middle] < item:
               __snake_case    			=	middle + 1
          else:
               __snake_case    			=	middle - 1
     sorted_list.insert(lowercase__       ,      lowercase__	)
     return sorted_list





def      _a		(lowercase__ :      str       ,      lowercase__ :      Optional[int]	) -> Optional[int]:






     """simple docstring"""
     __snake_case    			=	[]
     while left and right:
          if left[0][0] < right[0][0]:
               result.append(left.pop(0	)	)
          else:
               result.append(right.pop(0	)	)
     return result + left + right





def      _a		(lowercase__ :      int	) -> Dict:






     """simple docstring"""
     __snake_case    			=	len(lowercase__	)
     if length <= 1:
          return list_ad
     __snake_case    			=	length // 2
     return merge(sortlist_ad(list_ad[:middle]	)       ,      sortlist_ad(list_ad[middle:]	)	)





def      _a		(lowercase__ :      list[int]	) -> list[int]:






     """simple docstring"""

     if len(lowercase__	) <= 1:
          return collection
     __snake_case    			=	[]
     __snake_case    			=	False
     for i in range(0       ,      len(lowercase__	)       ,      2	):
          if i == len(lowercase__	) - 1:
               __snake_case    			=	True
          else:
               if collection[i] < collection[i + 1]:
                    two_paired_list.append([collection[i], collection[i + 1]]	)
               else:
                    two_paired_list.append([collection[i + 1], collection[i]]	)
     __snake_case    			=	sortlist_ad(lowercase__	)
     __snake_case    			=	[i[0] for i in sorted_list_ad]
     result.append(sorted_list_ad[-1][1]	)
     if has_last_odd_item:
          __snake_case    			=	collection[-1]
          __snake_case    			=	binary_search_insertion(lowercase__       ,      lowercase__	)
     __snake_case    			=	False
     for i in range(len(lowercase__	) - 1	):
          if result[i] == collection[-1] and has_last_odd_item:
               __snake_case    			=	True
          __snake_case    			=	sorted_list_ad[i][1]
          # If last_odd_item is inserted before the item's index,
          # you should forward index one more.
          if is_last_odd_item_inserted_before_this_index:
               __snake_case    			=	result[: i + 2] + binary_search_insertion(result[i + 2 :]       ,      lowercase__	)
          else:
               __snake_case    			=	result[: i + 1] + binary_search_insertion(result[i + 1 :]       ,      lowercase__	)

     return result


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








'''simple docstring'''




def      _a		(lowercase__ :      int	) -> int:






     """simple docstring"""
     return 1 if input_a == 0 else 0





def      _a		() -> None:






     """simple docstring"""
     assert not_gate(0	) == 1
     assert not_gate(1	) == 0


if __name__ == "__main__":
       print(not_gate(0))
       print(not_gate(1))




