#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=55,mo=1e9+7;
map<int,int>f;int a[N];
#define e(i,j)((i>>(j))&1)
int dfs(int x,int S){
	if(!x)return 1;
	if(f.find(S)!=f.end())return f[S];
	int w=0;__int128 U=0,V=S;
	f(i,1,n)if(!e(S,i))U|=V<<i;
	f(i,1,n)if((!a[x]||a[x]==i)&&!e(S,i)&&!e(U,i*2))w+=dfs(x-1,S|(1ll<<i));
	return f[S]=w%mo;
}
inline void doing(){
	cin>>n;m=0;s=1;f={};
	f(i,1,n)cin>>a[i];
	f(i,1,n)if(!a[i])s=s*(++m)%mo;
	cout<<(s+mo-dfs(n,0))%mo<<"\n";
}
signed main(){
	int t;
	cin>>t;
	while(t--)doing();
	return 0;
}