Luntik came out for a morning stroll and found an array a of length n. He calculated the sum s of the elements of the array (s= ∑_{i=1}^{n} a_i). Luntik calls a subsequence of the array a nearly full if the sum of the numbers in that subsequence is equal to s-1.

Luntik really wants to know the number of nearly full subsequences of the array a. But he needs to come home so he asks you to solve that problem!

A sequence x is a subsequence of a sequence y if x can be obtained from y by deletion of several (possibly, zero or all) elements.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. The next 2 ⋅ t lines contain descriptions of test cases. The description of each test case consists of two lines.

The first line of each test case contains a single integer n (1 ≤ n ≤ 60) — the length of the array.

The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9) — the elements of the array a.

Output

For each test case print the number of nearly full subsequences of the array.

Example

Input


5
5
1 2 3 4 5
2
1000 1000
2
1 0
5
3 0 2 1 1
5
2 1 0 3 0


Output


1
0
2
4
4

Note

In the first test case, s=1+2+3+4+5=15, only (2,3,4,5) is a nearly full subsequence among all subsequences, the sum in it is equal to 2+3+4+5=14=15-1.

In the second test case, there are no nearly full subsequences.

In the third test case, s=1+0=1, the nearly full subsequences are (0) and () (the sum of an empty subsequence is 0).
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pll pair<ll,ll>
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define trace(x) cerr<<#x<<": "<<x<<endl;
void debug_all(){ cerr<<"]\n"; }
template<typename T, typename... Types> 
void debug_all(T var1, Types... var2) { cerr<<' '<<var1<<' '; debug_all(var2...);}
#define dbgs(...) cerr<<"["<<#__VA_ARGS__<<"]: [", debug_all(__VA_ARGS__)
int binomialCoeff(int n, int r){
    if(r > n){
        return 0;
    }
    long long int m = 1000000007;
    long long int inv[r + 1] = {0};
    inv[0] = 1;
    if(r+1 >= 2){
        inv[1] = 1;
    }
    for(int i = 2; i <= r; i++){
        inv[i] = m - (m / i) * inv[m % i] % m;
    }
    int ans = 1;
    for (int i = 2; i <= r; i++){
        ans = ((ans % m) * (inv[i] % m)) % m;
    }
    for (int i = n; i >= (n - r + 1); i--){
        ans = ((ans % m) * (i % m)) % m;
    }
    return ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll tc, n, z, o, ans;
    cin>>tc;
    while(tc--){
        cin>>n;
        vector<ll>a(n);
        z = o = 0;
        for(int i = 0; i < n; i++){
            cin>>a[i];
            if(a[i] == 0){
                z++;
            }
            else if(a[i] == 1){
                o++;
            }
        }
        ans = o;
        for(int i = 1; i <= z; i++){
            ans += o*(binomialCoeff(z,i));
        }
        cout<<ans<<endl;

    }
    return 0;
}