Chef & Odd Numbers

Chef loves odd numbers so much. He has an array of integers of size $N$. The chef wants to make all the numbers in this array odd. In one operation chef can select two indices $i$ and $j$ ( $i$ ≠ $j$ & $1$ ≤ $i$ , $j$ ≤ $N$ ) and replace $Xi$ with ( $Xi$ + $Xj$). Chef has to make all elements in the array odd in minimum number operation. If there is no way to do it then print “$-1$ ”. ### Inp