#include <iostream>

#include <cstdio>

#include <fstream>

#include <algorithm>

#include <cmath>

#include <deque>

#include <vector>

#include <queue>

#include <string>

#include <cstring>

#include <map>

#include <stack>

#include <set>

#include <sstream>

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);

#define Mod 1000000007

#define eps 1e-6

#define ll long long

#define INF 0x3f3f3f3f

#define MEM(x,y) memset(x,y,sizeof(x))

#define Maxn 1000010

using namespace std;

ll T,n;

int main()

{

    freopen("azerah.in","r",stdin);

    freopen("azerah.out","w",stdout);

    cin>>T;

    while(T--)

    {

        cin>>n;

        ll x;

        ll n1=;//奇数个数

        ll n2=;//偶数个数

        for(ll i=; i<=n; i++)

        {

            cin>>x;

            if(x%)

                n1++;

            else

                n2++;

        }

        ll s1=;//奇数中的偶数子序列个数=2^(s1-1)-1

        ll s2=;//偶数中的偶数子序列个数=2^s2-1

        //怕溢出，就一步一步循环吧

        for(ll i=; i<=n2; i++)

        {

            s1*=;

            s1%=Mod;

        }

        for(ll i=; i<n1; i++)

        {

            s2*=;

            s2%=Mod;

        }

        s1--;

        s2--;

        cout<<(s1+s2+s1*s2)%Mod<<endl;

    }

    return ;

}