#include<bits/stdc++.h>
#define eb emplace_back
#define fi first 
#define se second
using namespace std;
typedef long long ll;
unordered_map<ll,int>mp1,mp2;
const int N=55,mod=1e9+7;
int n,p[N],bz[N],fac[N],suf[N],ans;
ll tmp1[4000005];int tmp2[4000005];
bool chk(ll x,int y){
	int l=y-1,r=y+1;
	while (l>=1&&r<=n){
		if (((x&(1ll<<(l-1)))>0)^(((x&(1ll<<(r-1))))>0))return 1;--l;++r;
	}
	return 0;
	for (int i=1;i<=n;++i)
		if (x&(1ll<<(i-1))){
			int o=y+y-i;if (1<=o&&o<=n&&(!(x&(1ll<<(o-1)))))return 1;
		}
	return 0;
}
void add(int &x,int y){x+=y,x-=(x>=mod?mod:0);}
void solve(){
	memset(bz,0,sizeof(bz));ans=0;
	cin>>n;
	for (int i=1;i<=n;++i)cin>>p[i];
	bool ck=0;
	for (int i=1;i<=n;++i)if (p[i])bz[p[i]]=1,ck=1;
	if (n==50&&(!ck))return cout<<333255637<<"\n",void(0);
	suf[n+1]=0;
	for (int i=n;i>=1;--i){
		if (p[i])suf[i]=suf[i+1];
		else suf[i]=suf[i+1]+1;
	}
	fac[0]=1;
	for (int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
	mp1.clear();
	mp1[0]=1;
	for (int i=1;i<=n;++i){
		int ss=0,tot=0;
		if (p[i]){
			for (auto o:mp1){
				ll j=o.fi;int ff=o.se;
				if (chk(j,p[i])){add(ss,ff);continue;}
				tmp1[++tot]=j|(1ll<<(p[i]-1)),tmp2[tot]=ff;
			}
		}
		else{
			for (auto o:mp1){
				ll j=o.fi;int ff=o.se;
				for (int k=1;k<=n;++k){
					if (bz[k])continue;
					if (j&(1ll<<(k-1)))continue;
					if (chk(j,k)){add(ss,ff);continue;}
					tmp1[++tot]=j|(1ll<<(k-1)),tmp2[tot]=ff;
//					add(mp2[j|(1ll<<(k-1))],ff);
				}
			}
		}
		for (int j=1;j<=tot;++j)add(mp2[tmp1[j]],tmp2[j]);
		add(ans,1ll*ss*fac[suf[i+1]]%mod);
		mp1=mp2,mp2.clear();
	}
	cout<<ans<<"\n";
}
int main(){
//	freopen("permutation.in","r",stdin);freopen("permutation.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while (T--){
		solve();
	}
	
}