


"""simple docstring"""


def _lowerCamelCase      (						_UpperCamelCase       ,					_UpperCamelCase       ,					_UpperCamelCase=False ):

			'''simple docstring'''




			if isinstance(_UpperCamelCase       ,					_UpperCamelCase ) and isinstance(_UpperCamelCase       ,					_UpperCamelCase ):
						__lowerCAmelCase							       =     len(set_a.intersection(_UpperCamelCase ) )

						if alternative_union:
									__lowerCAmelCase							       =     len(_UpperCamelCase ) + len(_UpperCamelCase )
						else:
									__lowerCAmelCase							       =     len(set_a.union(_UpperCamelCase ) )

						return intersection / union

			if isinstance(_UpperCamelCase       ,					(list, tuple) ) and isinstance(_UpperCamelCase       ,					(list, tuple) ):
						__lowerCAmelCase							       =     [element for element in set_a if element in set_b]

						if alternative_union:
									__lowerCAmelCase							       =     len(_UpperCamelCase ) + len(_UpperCamelCase )
									return len(_UpperCamelCase ) / union
						else:
									__lowerCAmelCase							       =     set_a + [element for element in set_b if element not in set_a]
									return len(_UpperCamelCase ) / len(_UpperCamelCase )

						return len(_UpperCamelCase ) / len(_UpperCamelCase )
			return None


if __name__ == "__main__":
	A	:  Any            =     {"a", "b", "c", "d", "e"}
	A	:  Optional[Any]            =     {"c", "d", "e", "f", "h", "i"}
	print(jaccard_similarity(set_a, set_b))








"""simple docstring"""


def _lowerCamelCase      (						_UpperCamelCase ):

			'''simple docstring'''




			__lowerCAmelCase							       =     False
			while is_sorted is False:  # Until all the indices are traversed keep looping
						__lowerCAmelCase							       =     True
						for i in range(0       ,					len(_UpperCamelCase ) - 1       ,					2 ):  # iterating over all even indices
									if input_list[i] > input_list[i + 1]:
												__lowerCAmelCase       ,      __lowerCAmelCase							       =     input_list[i + 1], input_list[i]
												# swapping if elements not in order
												__lowerCAmelCase							       =     False

						for i in range(1       ,					len(_UpperCamelCase ) - 1       ,					2 ):  # iterating over all odd indices
									if input_list[i] > input_list[i + 1]:
												__lowerCAmelCase       ,      __lowerCAmelCase							       =     input_list[i + 1], input_list[i]
												# swapping if elements not in order
												__lowerCAmelCase							       =     False
			return input_list


if __name__ == "__main__":
	print("Enter list to be sorted")
	A	:  Tuple            =     [int(x) for x in input().split()]
	# inputing elements of the list in one line
	A	:  Dict            =     odd_even_sort(input_list)
	print("The sorted list is")
	print(sorted_list)




