#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 <bitset>
#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 std;
using namespace __gnu_pbds;
bool Mbe;

//char buf[1<<20],*p1,*p2;
//#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
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;
}
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(x>y)x=y;}

const int mod=1e9+7;
int fplus(int x,int y){return x+y>=mod?x+y-mod:x+y;};
void Fplus(int&x,int y){x=fplus(x,y);}
ll ycl[51]={0,1,2,4,10,20,48,104,282,496,1066,2460,6128,12840,29380,74904,212728,368016,659296,1371056,2937136,6637232,15616616,38431556,96547832,198410168,419141312,941812088,2181990978,5624657008,14765405996,41918682488,121728075232,207996053184,360257593216,639536491376,1144978334240,2362611440576,4911144118024,10417809568016,22388184630824,50301508651032,113605533519568,265157938869936,622473467900178,1527398824248200,3784420902143392,9503564310606436,23991783779046768,48820872045382552,99986771685259808};
int n,a[51],fac[51];
map<int,int>dp[51];

bool Med;
signed main() {
	fprintf(stderr,"%.3lfMb\n",(&Mbe-&Med)/1024./1024.);
	fac[0]=1;
	rep(i,1,50)fac[i]=(ll)fac[i-1]*i%mod;
	for(int T=read();T--;){
		n=read();
		int mask=(1ll<<n)-1,free=0;
		rep(i,1,n){
			a[i]=read();
			if(a[i])mask^=(1ll<<(a[i]-1));
			else free++;
		}
		if(mask==(1ll<<n)-1){
			printf("%lld\n",fplus(fac[n],mod-ycl[n]%mod));
			continue;
		}
		rep(i,0,n)map<int,int>().swap(dp[i]);
		dp[0][0]=1;
		bool turn=1;
		rep(i,1,n/2)if(a[i])turn=0;
		if(turn)reverse(a+1,a+n+1);
		rep(i,1,n)for(pii p:dp[i-1]){
			int S=p.fi,val=p.se;
			if(!a[i]){
				rep(j,0,n-1)if(!(S>>j&1)&&(mask>>j&1)){
					bool flag=1;
					rep(k,0,n-1){
						if(j+j-k>=0&&j+j-k<n)flag&=!((S>>k&1)&&((((1ll<<n)-1)^S^(1ll<<j))>>(j+j-k))&1);
					}
					if(flag)Fplus(dp[i][S|(1ll<<j)],val);
				}
			}else{
				int j=a[i]-1;
				bool flag=1;
				rep(k,0,n-1){
					if(j+j-k>=0&&j+j-k<n)flag&=!((S>>k&1)&&((((1ll<<n)-1)^S^(1ll<<j))>>(j+j-k))&1);
				}
				if(flag)Fplus(dp[i][S|(1ll<<j)],val);
			}
		}
		printf("%lld\n",fplus(fac[free],mod-dp[n][(1ll<<n)-1]));
	}
	return 0;
}