#include<iostream>
#include<set>
#include<map>
#include<time.h>
#include<random>
#include<vector>
#include<iomanip>
#include<string.h>
#include<algorithm>
using namespace std;
//#pragma optimize(2)
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define str string
#define db double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pqMax(x) pq< x >
#define pqMin(x) pq< x ,vector< x >,greater< x > >
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define lowbit(x) ((x)&(-(x)))
#define sz(x) ((int) (x).size())
#define ms(a,t) memset(a,t,sizeof(a))
#define FORe(i, u, v) for (int i = h[u], v; v = e[i].to, i; i = e[i].nxt)
const ll INF = 0x3f3f3f3f;
const int maxn = 50+10;
const int maxm = 2e5+10;
const ll mod = 1e9+7;
const db eps = 1e-6;
//ll read() {
//	ll x=0,f=1;char ch=getchar();
//	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
//	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
//	return x*f;
//}
int n,m;
int a[maxn];
ll turn(ll x) {
	ll ret = 0;
	for(int i = 0; i < n; i++) {
		if((x >> i) & 1) ret |= (1ll<<(n-i-1)); 
	}
	return ret;
}
map<pair<int,ll>,ll> mp;
ll dfs(int p,ll st) {
	if(p == n+1) return 1;
	if(mp.count(MP(p,st))) return mp[MP(p,st)];
	ll rev = turn(st);
	ll ret = 0;
	for(int i = 1; i <= n; i++) {
		if((st >> (i-1)) & 1) continue;
		if(a[p] != 0 && i != a[p]) continue;
		int t = n - 2*i + 1;
//		cout<<' '<<(rev>>t)<<'\n';
		if(t >= 0) {
			if((st & ((1ll<<(n-t))-1)) ^ (rev >> t)) continue;
		} else {
			t = -t;
			if((st >> t) ^ (rev & ((1ll<<(n-t))-1))) continue;
		}
		ret += dfs(p+1,st | (1ll << (i-1)));
	}
//	cout<<p<<' '<<st<<' '<<rev<<' '<<ret%mod<<'\n';
	return mp[MP(p,st)] = ret % mod;
}
int f[maxn];
void Solve() {
	cin >> n;
	int cnt = 0;
	for(int i=1;i<=n;i++) {
		cin >> a[i];
		if(a[i] == 0) cnt++;
	}
	mp.clear();
	cout<<(f[cnt] - dfs(1,0) + mod) % mod<<'\n';
}
int main() {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
//	ios::sync_with_stdio(0);
//	cin.tie(0); cout.tie(0);
	f[0] = 1; for(int i = 1; i <= 50; i++) f[i] = 1ll * f[i-1] * i % mod;
	int tt; cin >> tt ; while(tt--)
	Solve();
	return 0;
}
/*
调试先查四件事
1. 数组开够没
2. ijk写错没
3. int爆了没
4. double取等了没
*/