Counting Problem

You are given an array $A = [A_1, A_2, \ldots, A_N]$. Is it possible to partition $A$ into two non-empty [subsequences](https://en.wikipedia.org/wiki/Subsequence) $S_1$ and $S_2$ such that $sum(S_1) \times sum(S_2)$ is **odd**? Here, $sum(S_1)$ denotes the sum of elements in $S_1$, and $sum(S_2)$ is defined similarly. **Note:** $S_1$ and $S_2$ must *partition* $A$, that is: - $S_1$ and $S_2$ mu