





from __future__ import annotations

def    lowerCamelCase_(lowerCamelCase_    ,   lowerCamelCase_    ) ->       tuple[int, int]:
						if b == 0:
												return (1, 0)
						((UpperCAmelCase)       ,		(UpperCAmelCase))         =     extended_euclid(lowerCamelCase_    ,   a % b    )
						UpperCAmelCase         =     a // b
						return (y, x - k * y)

def    lowerCamelCase_(lowerCamelCase_    ,   lowerCamelCase_    ,   lowerCamelCase_    ,   lowerCamelCase_    ) ->       int:
						((UpperCAmelCase)       ,		(UpperCAmelCase))         =     extended_euclid(lowerCamelCase_    ,   lowerCamelCase_    )
						UpperCAmelCase         =     na * na
						UpperCAmelCase         =     ra * x * na + ra * y * na
						return (n % m + m) % m

def    lowerCamelCase_(lowerCamelCase_    ,   lowerCamelCase_    ) ->       int:
						((UpperCAmelCase)       ,		(UpperCAmelCase))         =     extended_euclid(lowerCamelCase_    ,   lowerCamelCase_    )
						if b < 0:
												UpperCAmelCase         =     (b % n + n) % n
						return b

def    lowerCamelCase_(lowerCamelCase_    ,   lowerCamelCase_    ,   lowerCamelCase_    ,   lowerCamelCase_    ) ->       int:
						UpperCAmelCase       ,		UpperCAmelCase         =     invert_modulo(lowerCamelCase_    ,   lowerCamelCase_    ), invert_modulo(lowerCamelCase_    ,   lowerCamelCase_    )
						UpperCAmelCase         =     na * na
						UpperCAmelCase         =     ra * x * na + ra * y * na
						return (n % m + m) % m


if __name__ == "__main__":
		from doctest import testmod

		testmod(name="chinese_remainder_theorem", verbose=True)
		testmod(name="chinese_remainder_theorem2", verbose=True)
		testmod(name="invert_modulo", verbose=True)
		testmod(name="extended_euclid", verbose=True)








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))



