'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Optional[Any]      )					->     Tuple:






 '''simple docstring'''

 __lowerCAmelCase											=						len(lowerCAmelCase_      )
 for _ in range(lowerCAmelCase_      ):
  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			:      str					      =				list(range(10, 0, -1))
 print(f'Original: {arr}. Sorted: {odd_even_transposition(arr)}')










"""simple docstring"""







from collections import defaultdict
from math import ceil, sqrt




def    UpperCAmelCase__       (lowerCAmelCase_ = 100_0000  ,						lowerCAmelCase_ = 10   ):




					'''simple docstring'''


					__SCREAMING_SNAKE_CASE						   =				defaultdict(lowerCAmelCase_   )

					for outer_width in range(3  ,						(t_limit // 4) + 2   ):
										if outer_width * outer_width > t_limit:
															__SCREAMING_SNAKE_CASE						   =				max(
															    ceil(sqrt(outer_width * outer_width - t_limit   )   )  ,						1   )
										else:
															__SCREAMING_SNAKE_CASE						   =				1

										hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

										for hole_width in range(lowerCAmelCase_  ,						outer_width - 1  ,						2   ):
															count[outer_width * outer_width - hole_width * hole_width] += 1

					return sum(1 for n in count.values() if 1 <= n <= 10   )


if __name__ == "__main__":
		print(F"{solution() = }")
