


"""simple docstring"""







def 	lowercase     (							A_			)-> Union[str, Any]:
  '''simple docstring'''







  a		:						Union[str, Any] 				=     len(lowerCAmelCase__			)
  for i in range(length - 1			):
    a		:						str 				=     False
    for j in range(length - 1 - i			):
      if collection[j] > collection[j + 1]:
        a		:						Union[str, Any] 				=     True
        a		:						Any 				=     collection[j + 1], collection[j]
    if not swapped:
      break  # Stop iteration if the collection is sorted.
  return collection


if __name__ == "__main__":
 import doctest
 import time

 doctest.testmod()

 __lowercase          = input("""Enter numbers separated by a comma:""").strip()
 __lowercase          = [int(item) for item in user_input.split(""",""")]
 __lowercase          = time.process_time()
 print(*bubble_sort(unsorted), sep=""",""")
 print(f'''Processing time: {(time.process_time() - start)%1e9 + 7}''')














def        _lowerCamelCase(      lowerCAmelCase__					:		int = 99_8001   ):





				'''simple docstring'''







				for number in range(n - 1     ,     9999     ,     -1   ):
								SCREAMING_SNAKE_CASE_ :						int    				= str(lowerCAmelCase__   )

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												SCREAMING_SNAKE_CASE_ :						str    				= 999

												# if 'number' is a product of two 3-digit numbers
												# then number is the answer otherwise fetch next number.
												while divisor != 99:
																if (number % divisor == 0) and (len(str(number // divisor   )   ) == 3.0):
																				return number
																divisor -= 1
				raise ValueError('That number is larger than our acceptable range.'   )


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