Even Out
Description
You are given an array $A$ of $n$ integers, where the $i$-th element is $A_i$. You can choose exactly one $i$ such that $1 \leq i \leq n$ and change $A_i$ to $-A_i$ (in other words, you change the sign of $A_i$). You want to make the sum of the array even. In how many ways can you do this?
The first line contains an integer $T(1 \leq T \leq 100)$, the number of test cases.
For each test case, there are two lines. On the first line you are given $n\space(1 \leq n \leq 100)$, the number of integers in the array. The next line contains $n$ space-separated integers $A_1, A_2, ... , A_n\space(-100 \leq A_i \leq 100) $ denoting the array $A$.
For each test case, print one integer in seperate lines denoting the number of ways you can make the sum of the array even.
Input
The first line contains an integer $T(1 \leq T \leq 100)$, the number of test cases.
For each test case, there are two lines. On the first line you are given $n\space(1 \leq n \leq 100)$, the number of integers in the array. The next line contains $n$ space-separated integers $A_1, A_2, ... , A_n\space(-100 \leq A_i \leq 100) $ denoting the array $A$.
Output
For each test case, print one integer in seperate lines denoting the number of ways you can make the sum of the array even.
2
2
0 0
6
2 3 5 -2 -3 0
2
0
Note
In the first sample, there are two $0$s. You can change the sign of either of them (it remains $0$). So the sum is always $0$, which is even. So there are $2$ ways to make the sum even.
In the second sample, you can verify that no matter which element you change the sign of, the sum is not even. So there are $0$ ways.