



def    lowerCamelCase_(lowerCamelCase_    ) ->       int:
						assert (
						    isinstance(lowerCamelCase_    ,   lowerCamelCase_    ) and number_of_steps > 0
						), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
						if number_of_steps == 1:
												return 1
						UpperCAmelCase       ,		UpperCAmelCase         =     1, 1
						for _ in range(number_of_steps - 1    ):
												UpperCAmelCase       ,		UpperCAmelCase         =     current + previous, current
						return current


if __name__ == "__main__":
		import doctest

		doctest.testmod()








def    lowerCamelCase_(lowerCamelCase_    ) ->       list[int]:
						UpperCAmelCase         =     len(lowerCamelCase_    )
						for i in range(lowerCamelCase_    ):
												for j in range(i + 1    ,   lowerCamelCase_    ):
																		if numbers[j] < numbers[i]:
																								UpperCAmelCase       ,		UpperCAmelCase         =     numbers[j], numbers[i]
						return numbers


if __name__ == "__main__":
		__lowerCamelCase     :							int  							=				input("Enter numbers separated by a comma:\n").strip()
		__lowerCamelCase     :							Dict  							=				[int(item) for item in user_input.split(",")]
		print(exchange_sort(unsorted))



