All Odd Prefix Sums

You are given an array $A$ of size $N$. Can the array be rearranged such that all the (non-empty) prefixes of the array has an odd sum? Formally, does there exist a rearrangement array $B$ of the array $A$ such that $B_1 + B_2 + \ldots + B_i$ is odd for every $1 \le i \le N$. Output $\text{Yes}$ if it is possible and $\text{No}$ otherwise. ### Input - The first line of input will contain a sing