Number of Subsequences with Odd Sum

Count the number of non-empty subsequences of an integer array whose sum is odd (answer may be large — typically return modulo 1e9+7). The core challenge is tracking parity combinations efficiently — e.g., using parity-based DP or combinatorics to update counts of even/odd-sum subsequences as you iterate the array.