

def 		UpperCamelCase   (lowercase_:					int   )	-> int:
	assert (
	    isinstance(lowercase_       , lowercase_   ) 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
	A__  ,  A__				:       List[Any]	  =						1, 1
	for _ in range(number_of_steps - 1   ):
		A__  ,  A__				:       Union[str, Any]	  =						current + previous, current
	return current


if __name__ == "__main__":
	import doctest

	doctest.testmod()






def 		UpperCamelCase   (lowercase_:					list   )	-> list:
	A__				:       Union[str, Any]	  =						False
	while is_sorted is False:  # Until all the indices are traversed keep looping
		A__				:       Dict	  =						True
		for i in range(0       , len(lowercase_   ) - 1       , 2   ):  # iterating over all even indices
			if input_list[i] > input_list[i + 1]:
				A__  ,  A__				:       Dict	  =						input_list[i + 1], input_list[i]
				# swapping if elements not in order
				A__				:       Optional[Any]	  =						False

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


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



