Make the Sum Even

### Read problem statements in [Russian](https://www.codechef.com/download/translated/LTIME94/russian/MKSMEVN.pdf) Chef has a sequence $A_1, A_2, \ldots, A_N$. In one operation, Chef can choose one index $i$ ($1 \leq i \leq N$) and change $A_i$ to $A_i^p$, where $p = \max\left(0, {\lceil \frac{A_i}{2} \rceil} - 1\right)$. Help Chef find the smallest number of operations needed to make the su