

def       __lowerCAmelCase      (						A       ,     A    ):

	# Check if the input is valid
	if not len(A    ) == len(A    ) == 3:
		raise ValueError("Please enter a valid equation."    )
	if equationa[0] == equationa[1] == equationa[0] == equationa[1] == 0:
		raise ValueError("Both a & b of two equations can't be zero."    )

	# Extract the coefficients
	UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_       				=			equationa
	UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_       				=			equationa

	# Calculate the determinants of the matrices
	UpperCAmelCase_       				=			aa * ba - aa * ba
	UpperCAmelCase_       				=			ca * ba - ca * ba
	UpperCAmelCase_       				=			aa * ca - aa * ca

	# Check if the system of linear equations has a solution (using Cramer's rule)
	if determinant == 0:
		if determinant_x == determinant_y == 0:
			raise ValueError("Infinite solutions. (Consistent system)"    )
		else:
			raise ValueError("No solution. (Inconsistent system)"    )
	else:
		if determinant_x == determinant_y == 0:
			# Trivial solution (Inconsistent system)
			return (0.0, 0.0)
		else:
			UpperCAmelCase_       				=			determinant_x / determinant
			UpperCAmelCase_       				=			determinant_y / determinant
			# Non-Trivial Solution (Consistent system)
			return (x, y)


def       __lowerCAmelCase      (						A    ):
	if len(A    ) <= 1:
		return lst

	UpperCAmelCase_       				=			1

	while i < len(A    ):
		if lst[i - 1] <= lst[i]:
			i += 1
		else:
			UpperCAmelCase_				,   UpperCAmelCase_       				=			lst[i], lst[i - 1]
			i -= 1
			if i == 0:
				UpperCAmelCase_       				=			1

	return lst


if __name__ == "__main__":
				_a:    List[Any] 							=			input("""Enter numbers separated by a comma:\n""").strip()
				_a:    Optional[int] 							=			[int(item) for item in user_input.split(""",""")]
				print(gnome_sort(unsorted))