#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;
typedef unsigned long long ull;
map<ull,pair<int,ull> > dp,tmp;
int n;
#define mod ((long long)(1e9)+7)
void fen(ull x){
	printf("{");
	for(int i=0;i<n;++i){
		if(((x)>>i)&1){
			printf("%d ",i);
		}
	}
	printf("}");
}
bool check(ull x,ull fx,int add){
	fx=~fx;
	fx&=(1ULL<<n)-1;
	if(add<=n/2){
		fx>>=max(n-add*2-1,0);
	}else{
		x>>=max(add*2-n+1,0);
	}
	return (x&fx)==0;
}
void run(){
	dp.clear();
	tmp.clear();
	dp[0].first=1,dp[0].second=0;
	scanf("%d",&n);
	ull jj=n;
	for(int ww=0;ww!=n;++ww){
		int x;
		scanf("%d",&x);
		if(x==0){
			for(map<ull,pair<int,ull> >::iterator it=dp.begin();it!=dp.end();++it){
				for(x=0;x<n;++x){
					if((it->first>>x)&1){
						continue;
					}
					if(check(it->first,it->second.second,x)){
						(tmp[it->first|(1<<x)].first+=it->second.first)%=mod,tmp[it->first|(1<<x)].second=it->second.second|(1<<(n-x-1));
					}
				}
			}
		}else{
			jj--;
			x--;
			for(map<ull,pair<int,ull> >::iterator it=dp.begin();it!=dp.end();++it){
				if((it->first>>x)&1){
					continue;
				}
				if(check(it->first,it->second.second,x)){
					(tmp[it->first|(1<<x)].first+=it->second.first)%=mod,tmp[it->first|(1<<x)].second=it->second.second|(1<<(n-x-1));
				}
			}
		}
		dp=tmp;
		tmp.clear();
	}
	ull jie=1;
	for(ull i=1;i<=jj;++i){
		jie=(jie*i)%mod;
	}
	printf("%lld\n",(jie-dp[(1<<n)-1].first+mod)%mod);
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		run();
	}
	return 0;
}