






def        _lowerCamelCase		(  __A      :							Union[str, Any]	) ->   int:
    _UpperCAmelCase			: Any     					=			len(__A	)
    for _ in range(
        0						,						int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
        for j in range(0						,						no_of_elements - 1	):
            if (
                lst[j + 1] < lst[j]
            ):  # applying bubble sort algorithm from left to right (or forwards)
                _UpperCAmelCase			: Optional[Any]     					=			lst[j + 1]
                _UpperCAmelCase			: Optional[int]     					=			lst[j]
                _UpperCAmelCase			: List[str]     					=			temp
            if (
                lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
            ):  # applying bubble sort algorithm from right to left (or backwards)
                _UpperCAmelCase			: Optional[int]     					=			lst[no_of_elements - 1 - j]
                _UpperCAmelCase			: List[Any]     					=			lst[no_of_elements - 2 - j]
                _UpperCAmelCase			: str     					=			temp
    return lst


if __name__ == "__main__":
  print('enter the list to be sorted')
  SCREAMING_SNAKE_CASE								=  [int(x) for x in input().split()]  # inputing elements of the list in one line
  SCREAMING_SNAKE_CASE								=  double_sort(lst)
  print('the sorted list is')
  print(sorted_lst)












def        _lowerCamelCase		(  __A      :							list	) ->   list:
    _UpperCAmelCase			: Dict     					=			1.3
    _UpperCAmelCase			: Any     					=			len(__A	)
    _UpperCAmelCase			: List[Any]     					=			False

    while not completed:
        # Update the gap value for a next comb
        _UpperCAmelCase			: Optional[Any]     					=			int(gap / shrink_factor	)
        if gap <= 1:
            _UpperCAmelCase			: Any     					=			True

        _UpperCAmelCase			: Optional[Any]     					=			0
        while index + gap < len(__A	):
            if data[index] > data[index + gap]:
                # Swap values
                _UpperCAmelCase					,	_UpperCAmelCase			: Union[str, Any]     					=			data[index + gap], data[index]
                _UpperCAmelCase			: Any     					=			False
            index += 1

    return data


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  SCREAMING_SNAKE_CASE								=  input('Enter numbers separated by a comma:\n').strip()
  SCREAMING_SNAKE_CASE								=  [int(item) for item in user_input.split(',')]
  print(comb_sort(unsorted))




