

def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise ValueError('Input series is not valid, valid series - [2, 4, 8]'      )
     if len(lowerCAmelCase_      ) == 0:
          raise ValueError('Input list must be a non empty list'      )
     if len(lowerCAmelCase_      ) == 1:
          return True
     try:
          SCREAMING_SNAKE_CASE										=series[1] / series[0]
          for index in range(len(lowerCAmelCase_      ) - 1      ):
               if series[index + 1] / series[index] != common_ratio:
                    return False
     except ZeroDivisionError:
          return False
     return True







def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise ValueError('Input series is not valid, valid series - [2, 4, 8]'      )
     if len(lowerCAmelCase_      ) == 0:
          raise ValueError('Input list must be a non empty list'      )
     SCREAMING_SNAKE_CASE										=1
     for value in series:
          answer *= value
     return pow(lowerCAmelCase_,   1 / len(lowerCAmelCase_      )      )


if __name__ == "__main__":
 import doctest

 doctest.testmod()




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)

