

from ..utils import DummyObject, requires_backends



class 		a_	(							metaclass=lowerCamelCase_					):



      """simple docstring"""







      __UpperCAmelCase      		=				['torch', 'transformers', 'invisible_watermark']
      def __init__(				self					:							str      ,*snake_case					:							List[Any]      ,**snake_case					:							str    ):
           requires_backends(self      ,['torch', 'transformers', 'invisible_watermark']    )
      @classmethod
      def 	_lowerCAmelCase					(				cls					:							Dict      ,*snake_case					:							int      ,**snake_case					:							Optional[int]    ):
           requires_backends(cls      ,['torch', 'transformers', 'invisible_watermark']    )


      @classmethod
      def 	_lowerCAmelCase					(				cls					:							Any      ,*snake_case					:							int      ,**snake_case					:							int    ):
           requires_backends(cls      ,['torch', 'transformers', 'invisible_watermark']    )







class 		a_	(							metaclass=lowerCamelCase_					):



      """simple docstring"""







      __UpperCAmelCase      		=				['torch', 'transformers', 'invisible_watermark']
      def __init__(				self					:							Any      ,*snake_case					:							Union[str, Any]      ,**snake_case					:							Union[str, Any]    ):
           requires_backends(self      ,['torch', 'transformers', 'invisible_watermark']    )
      @classmethod
      def 	_lowerCAmelCase					(				cls					:							Optional[Any]      ,*snake_case					:							Dict      ,**snake_case					:							Optional[Any]    ):
           requires_backends(cls      ,['torch', 'transformers', 'invisible_watermark']    )


      @classmethod
      def 	_lowerCAmelCase					(				cls					:							List[Any]      ,*snake_case					:							Dict      ,**snake_case					:							Optional[Any]    ):
           requires_backends(cls      ,['torch', 'transformers', 'invisible_watermark']    )




def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=len(lowerCAmelCase_      )
     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)
                    SCREAMING_SNAKE_CASE										=lst[j + 1]
                    SCREAMING_SNAKE_CASE										=lst[j]
                    SCREAMING_SNAKE_CASE										=temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 1 - j]
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 2 - j]
                    SCREAMING_SNAKE_CASE										=temp
     return lst


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

