

def 		UpperCamelCase   (lowercase_:					int = 3       , lowercase_:					int = 7       , lowercase_:					int = 1000000   )	-> int:
	A__				:       List[Any]	  =						0
	A__				:       Tuple	  =						1

	for current_denominator in range(1       , limit + 1   ):
		A__				:       str	  =						current_denominator * numerator // denominator
		if current_denominator % denominator == 0:
			current_numerator -= 1
		if current_numerator * max_denominator > current_denominator * max_numerator:
			A__				:       Dict	  =						current_numerator
			A__				:       List[str]	  =						current_denominator
	return max_numerator


if __name__ == "__main__":
	print(solution(numerator=3, denominator=7, limit=100_0000))






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)



