#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <ctime>
#include <random>
#include <cassert>
#include <numeric>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#define pii pair<int, int>
#define fi first
#define se second
#define MP make_pair
#define ep emplace
#define eb emplace_back
#define int long long
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (j); i >= (k); i--)
typedef double db;
typedef long double ldb;
typedef long long ll;
//typedef __int128 lll;
typedef unsigned long long ull;
typedef unsigned int ui;
using namespace __gnu_pbds;
using namespace std;

int read() {
	int s = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
	return f ? s : -s;
}

const int N=55,mod=1e9+7;
int n,a[N];
gp_hash_table<ll,int>f[2];

signed main() {
	for(int T=read();T--;){
		n=read();
		int cnt=0,mul=1;
		rep(i,1,n)a[i]=read();
		rep(i,1,n)if(!a[i])cnt++;
		rep(i,1,cnt)mul*=i;
		int cur=0;
		f[0].clear(),f[0][0]=1;
		rep(i,1,n){
			cur^=1;
			f[cur].clear();
			rep(S,0,(1<<n)-1)if(f[cur^1][S]){
				rep(j,a[i]?a[i]:0,a[i]?a[i]:n-1)if(!(S>>j&1)){
					bool flag=1;
					rep(k,0,n-1){
						if(!(S>>k&1)&&(S>>(j+j-k)&1)){
							flag=0;
							break;
						}
					}
					if(flag)(f[cur][S^(1ll<<j)]+=f[cur^1][S])%=mod;
				}
			}
		}
		printf("%lld\n",(mul-f[cur][(1ll<<n)-1]+mod)%mod);
	}
	return 0;
}