Yet Another Palindrome Making Problem

Chef has a string $A$ (containing lowercase Latin letters only) of length $N$ where $N$ is **even**. He can perform the following operation any number of times: - Swap $A_i$ and $A_{i + 2}$ for any $1 \le i \le (N - 2)$ Determine if Chef can convert string $A$ to a palindromic string. **Note**: A string is called a palindrome if it reads the same backwards and forwards. For example, $\texttt{noo