
def 							_lowercase							(     UpperCamelCase_		)		->		list:
					'''simple docstring'''


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

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


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







def 							_lowercase							(     )		->		Optional[int]:
					'''simple docstring'''


					SCREAMING_SNAKE_CASE__													= []
					SCREAMING_SNAKE_CASE__													= 1

					while len(UpperCamelCase_		) < 1e6:
										constant.append(str(UpperCamelCase_		)		)
										i += 1

					SCREAMING_SNAKE_CASE__													= ''.join(UpperCamelCase_		)

					return (
					    int(constant[0]		)
					    * int(constant[9]		)
					    * int(constant[99]		)
					    * int(constant[999]		)
					    * int(constant[9999]		)
					    * int(constant[99999]		)
					    * int(constant[999999]		)
					)


if __name__ == "__main__":
				print(solution())





