


def 	SCREAMING_SNAKE_CASE_						(      __A			:      int = 1_00    )     ->		int:

       """simple docstring"""

       a_ :		Optional[int]							=  n * (n + 1) * (2 * n + 1) / 6
       a_ :		Optional[Any]							=  (n * (n + 1) / 2) ** 2
       return int(square_of_sum - sum_of_squares    )


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






def 	SCREAMING_SNAKE_CASE_						(      __A			:      list    )     ->		list:

       """simple docstring"""

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

       return arr


if __name__ == "__main__":
   UpperCAmelCase_				:			int   =	list(range(10, 0, -1))
   print(F'Original: {arr}. Sorted: {odd_even_transposition(arr)}')


