





class 					__A    :

			'''simple docstring'''







			def __init__(    self       ,  __lowerCAmelCase							):



				'''simple docstring'''







				lowerCamelCase__								=		n
				lowerCamelCase__								=		[None] * self.n
				lowerCamelCase__								=		0  # index of the first element
				lowerCamelCase__								=		0
				lowerCamelCase__								=		0





			def __len__(    self							):



				'''simple docstring'''







				return self.size





			def 		__lowerCamelCase				(    self							):



				'''simple docstring'''







				return self.size == 0





			def 		__lowerCamelCase				(    self							):



				'''simple docstring'''







				return False if self.is_empty() else self.array[self.front]





			def 		__lowerCamelCase				(    self       ,  __lowerCAmelCase							):



				'''simple docstring'''







				if self.size >= self.n:
					raise Exception('''QUEUE IS FULL'''							)

				lowerCamelCase__								=		data
				lowerCamelCase__								=		(self.rear + 1) % self.n
				self.size += 1
				return self





			def 		__lowerCamelCase				(    self							):



				'''simple docstring'''







				if self.size == 0:
					raise Exception('''UNDERFLOW'''							)

				lowerCamelCase__								=		self.array[self.front]
				lowerCamelCase__								=		None
				lowerCamelCase__								=		(self.front + 1) % self.n
				self.size -= 1
				return temp










def lowerCAmelCase__(__snake_case							)				->      list:







	'''simple docstring'''







	lowerCamelCase__								=		len(__snake_case							)
	for _ in range(__snake_case							):
		for i in range(_ % 2       ,arr_size - 1       ,2							):
			if arr[i + 1] < arr[i]:
				lowerCamelCase__				,	lowerCamelCase__								=		arr[i + 1], arr[i]

	return arr


if __name__ == "__main__":
			_a 						=      list(range(10, 0, -1))
			print(f"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")



