






import os
from string import ascii_letters

_a       =    ascii_letters + " \t\n"


def __A       ( )->    dict[str, None]:





						"""simple docstring"""



						_UpperCAmelCase							   =     os.path.split(os.path.realpath(UpperCamelCase__      )      )
						_UpperCAmelCase							   =     {}
						with open(path[0] + '/dictionary.txt'      ) as dictionary_file:
												for word in dictionary_file.read().split('\n'      ):
																		_UpperCAmelCase							   =     None
						return english_words


_a       =    load_dictionary()


def __A       ( __lowerCAmelCase      )->    float:





						"""simple docstring"""



						_UpperCAmelCase							   =     message.upper()
						_UpperCAmelCase							   =     remove_non_letters(UpperCamelCase__      )
						_UpperCAmelCase							   =     message.split()
						_UpperCAmelCase							   =     len([word for word in possible_words if word in ENGLISH_WORDS]      )
						return float(UpperCamelCase__      ) / len(UpperCamelCase__      )


def __A       ( __lowerCAmelCase      )->    str:





						"""simple docstring"""



						return "".join(symbol for symbol in message if symbol in LETTERS_AND_SPACE      )


def __A       ( __lowerCAmelCase					,						__lowerCAmelCase = 20					,						__lowerCAmelCase = 85      )->    bool:





						"""simple docstring"""



						_UpperCAmelCase							   =     get_english_count(UpperCamelCase__      ) * 100 >= word_percentage
						_UpperCAmelCase							   =     len(remove_non_letters(UpperCamelCase__      )      )
						_UpperCAmelCase							   =     (float(UpperCamelCase__      ) / len(UpperCamelCase__      )) * 100
						_UpperCAmelCase							   =     message_letters_percentage >= letter_percentage
						return words_match and letters_match


if __name__ == "__main__":
		import doctest

		doctest.testmod()





'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:int			)		->						Any:
				snake_case__      :   Dict      =    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)
																snake_case__      :   int      =    lst[j + 1]
																snake_case__      :   Tuple      =    lst[j]
																snake_case__      :   Tuple      =    temp
												if (
												    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
												):  # applying bubble sort algorithm from right to left (or backwards)
																snake_case__      :   Optional[Any]      =    lst[no_of_elements - 1 - j]
																snake_case__      :   Tuple      =    lst[no_of_elements - 2 - j]
																snake_case__      :   Any      =    temp
				return lst


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




