"""simple docstring"""






from __future__ import annotations

from collections import deque
from queue import Queue
from timeit import timeit

UpperCamelCase     					=     {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B'],
    'E': ['B', 'F'],
    'F': ['C', 'E'],
}

def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:dict		,			_SCREAMING_SNAKE_CASE	:str  )				-> list[str]:
						a_							:			Any     		=					{start}
						a_							:			Tuple     		=					[start]
						a_							:			Queue     		=					Queue()
						queue.put(_SCREAMING_SNAKE_CASE  )
						while not queue.empty():
												a_							:			Any     		=					queue.get()
												for w in graph[v]:
																		if w not in explored:
																								explored.add(_SCREAMING_SNAKE_CASE  )
																								result.append(_SCREAMING_SNAKE_CASE  )
																								queue.put(_SCREAMING_SNAKE_CASE  )
						return result

def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:dict		,			_SCREAMING_SNAKE_CASE	:str  )				-> list[str]:
						a_							:			Optional[Any]     		=					{start}
						a_							:			Union[str, Any]     		=					[start]
						a_							:			int     		=					deque([start]  )
						while queue:
												a_							:			List[str]     		=					queue.popleft()
												for child in graph[v]:
																		if child not in visited:
																								visited.add(_SCREAMING_SNAKE_CASE  )
																								result.append(_SCREAMING_SNAKE_CASE  )
																								queue.append(_SCREAMING_SNAKE_CASE  )
						return result

def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:str  )				-> None:
						a_							:			Optional[Any]     		=					F'''from __main__ import G, {name}'''
						a_							:			Optional[int]     		=					10000
						a_							:			str     		=					timeit(F'''{name}(G, \'A\')'''		,			setup=_SCREAMING_SNAKE_CASE		,			number=_SCREAMING_SNAKE_CASE  )
						print(F'''{name:<35} finished {number} runs in {res:.5f} seconds'''  )


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				benchmark_function('breadth_first_search')
				benchmark_function('breadth_first_search_with_deque')
				# breadth_first_search                finished 10000 runs in 0.20999 seconds
				# breadth_first_search_with_deque     finished 10000 runs in 0.01421 seconds





"""simple docstring"""






def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:int  )				-> Optional[int]:
						a_							:			List[Any]     		=					len(_SCREAMING_SNAKE_CASE  )
						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_							:			List[str]     		=					lst[j + 1]
																								a_							:			Optional[Any]     		=					lst[j]
																								a_							:			Optional[Any]     		=					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_							:			Dict     		=					lst[no_of_elements - 1 - j]
																								a_							:			Dict     		=					lst[no_of_elements - 2 - j]
																								a_							:			Any     		=					temp
						return lst


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




