


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

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


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









'''simple docstring'''
def       a_				(	UpperCamelCase_ ):

							if length <= 0 or not isinstance(UpperCamelCase_						,  UpperCamelCase_ ):
														raise ValueError("Length must be a positive integer." )
							return [n * (2 * n - 1) for n in range(UpperCamelCase_ )]


if __name__ == "__main__":
							print(hexagonal_numbers(length=5))
							print(hexagonal_numbers(length=10))





