



def 						UpperCAmelCase__   (   UpperCAmelCase__			:Optional[Any]       ):






 '''simple docstring'''

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


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





'''simple docstring'''
def 				lowerCAmelCase__	(       UpperCAmelCase = 30     ):






       """simple docstring"""





       snake_case__					:	Tuple          =					exponent + 2
       snake_case__					:	List[Any]          =					(1 + 5**0.5) / 2
       snake_case__					:	Tuple          =					(phi**fibonacci_index - (phi - 1) ** fibonacci_index) / 5**0.5

       return int(UpperCAmelCase     )


if __name__ == "__main__":
     print(f"""{solution() = }""")




