


def 			lowerCAmelCase__					(     a__:						Any			)    ->						int:


							'''simple docstring'''





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

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


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







'''simple docstring'''






def   UpperCamelCase__ (						lowerCAmelCase    ):





      """simple docstring"""


      if not isinstance(lowerCAmelCase				,      lowerCAmelCase    ):
            raise ValueError("""Input must be an integer"""    )
      if input_num <= 0:
            raise ValueError("""Input must be positive"""    )
      return sum(
          divisor for divisor in range(1				,      input_num // 2 + 1    ) if input_num % divisor == 0    )


if __name__ == "__main__":
      import doctest

      doctest.testmod()






