
def 		UpperCamelCase    (					_UpperCAmelCase     :      Dict     )      -> Optional[int]:






						'''simple docstring'''

						_lowercase					:  int    			=      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)
																								_lowercase					:  Dict    			=      lst[j + 1]
																								_lowercase					:  Union[str, Any]    			=      lst[j]
																								_lowercase					:  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)
																								_lowercase					:  int    			=      lst[no_of_elements - 1 - j]
																								_lowercase					:  Tuple    			=      lst[no_of_elements - 2 - j]
																								_lowercase					:  int    			=      temp
						return lst


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






def 		UpperCamelCase    (					_UpperCAmelCase     :      int     )      -> bool:






						'''simple docstring'''

						if not isinstance(_UpperCAmelCase   , _UpperCAmelCase     ):
												_lowercase					:  Optional[int]    			=      f"""Input value of [number={number}] must be an integer"""
												raise TypeError(_UpperCAmelCase     )
						if number < 0 or number % 2 == 1:
												return False
						_lowercase					:  List[str]    			=      int(number**0.5     )
						return number == number_sqrt * (number_sqrt + 1)


if __name__ == "__main__":
							import doctest

							doctest.testmod()




