




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


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







def 		a_       (   __lowerCAmelCase      ,   __lowerCAmelCase							):
  lowerCAmelCase__								=			0
  for ele in arr:
    total_sum += product_sum(__lowerCAmelCase      ,   depth + 1							) if isinstance(__lowerCAmelCase      ,   __lowerCAmelCase							) else ele
  return total_sum * depth
def 		a_       (   __lowerCAmelCase							):
  return product_sum(__lowerCAmelCase      ,   1							)


if __name__ == "__main__":
      import doctest

      doctest.testmod()

