Bob has an array $A$ of length $N$ and he wants to gift Alice a subsequence of this array
But Alice doesn't like a subsequence if the sum of the elements in that subsequence is odd
Find out how many subsequences can Bob gift her modulo $10^9 + 7$

Input Format :
The first line contains $N$, the size of the array 
The second line contains $N$ elements, representing the array $A$ 

Output Format :
Print one integer, the number of possible ways Bob can gift Alice modulo $10^9 + 7$

Constraints :

$1 \leq N \leq 2*10^5 \\ 1 \leq a[i] \leq 10^{15}$ 

Note: Use 64-bit integer data type