Odd Even Binary String

Chef had an array $A$ of length $N$ such that $1 \le A_i \le N$ for all $1 \le i \le N$. Chef constructed another **binary** array $B$ of length $N$ in the following manner: - $B_i = 1$ if the frequency of element $i$ in $A$ is *odd*. - $B_i = 0$ if the frequency of element $i$ in $A$ is *even*. Such an array $B$ is called the *parity encoding* array of $A$. For example, if $A = [1, 1, 2, 3]$, t