


def      __lowerCamelCase		(				lowerCamelCase__						:		list	):





			'''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  						=   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  						=   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")
		UpperCAmelCase					:  Any			=						[int(x) for x in input().split()]
		# inputing elements of the list in one line
		UpperCAmelCase					:  Tuple			=						odd_even_sort(input_list)
		print("The sorted list is")
		print(sorted_list)





def 				__lowerCamelCase						( UpperCAmelCase_						:		int ,  UpperCAmelCase_						:		int						):




      """simple docstring"""





      while b:
            a							,				a						:Optional[Any] 							=       b, a % b
      return a
def 				__lowerCamelCase						( UpperCAmelCase_						:		int ,  UpperCAmelCase_						:		int						):




      """simple docstring"""





      return a if b == 0 else euclidean_gcd_recursive(UpperCAmelCase_ ,  a % b						)
def 				__lowerCamelCase						( ):




      """simple docstring"""





      print(F'''euclidean_gcd(3, 5) = {euclidean_gcd(3 ,  5						)}'''						)
      print(F'''euclidean_gcd(5, 3) = {euclidean_gcd(5 ,  3						)}'''						)
      print(F'''euclidean_gcd(1, 3) = {euclidean_gcd(1 ,  3						)}'''						)
      print(F'''euclidean_gcd(3, 6) = {euclidean_gcd(3 ,  6						)}'''						)
      print(F'''euclidean_gcd(6, 3) = {euclidean_gcd(6 ,  3						)}'''						)

      print(F'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3 ,  5						)}'''						)
      print(F'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5 ,  3						)}'''						)
      print(F'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1 ,  3						)}'''						)
      print(F'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3 ,  6						)}'''						)
      print(F'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6 ,  3						)}'''						)


if __name__ == "__main__":
     main()





