Break Free

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (ll)1e9+7
#define pmod(a,b) (((a%MOD)*(b%MOD))%MOD)

ll solve(){
    ll N,countEven=0,countOdd=0;
    cin>>N;
    int A[N];
    for(int i=0;i<N;i++) {
        cin>>A[i];
        if(A[i]%2) countOdd++;
        else countEven++;
    }
    ll ans=1;
    while(countEven){
        ans=ans*2;
        ans=ans%1000000007;
        countEven--;
    }
    if(countOdd) return ans;
    return ans-1;
}
int main() {
	// your code goes here
	int T;
	cin>>T;
	while(T--)
	{
	    cout<<solve()<<"\n";
	}
	return 0;
}