Xor Palindrome

A ($1$-indexed) binary string $S$ of length $N$ is called a *xor palindrome* if the value of $S_i \oplus S_{(N + 1 - i)}$ is the same for all $1 \le i \le N$. For example, $0$, $1111$ and $0101$ are xor palindromes, while $1110$ and $110101$ are not. You are given a binary string $S$ of length $N$. Determine if it is possible to rearrange it to form a xor palindrome or not. ### Input - The firs