#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int long long

char *p1,*p2,buf[100000];
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int read()
{
	int x=0,f=1;
	char ch=nc();
	while(ch<48||ch>57)
	{
		if(ch=='-')
			f=-1;
		ch=nc();
	}
	while(ch>=48&&ch<=57)
		x=x*10+ch-48,ch=nc();
	return x*f;
}

void write(int x)
{
	if(x<0)
		putchar('-'),x=-x;
	if(x>9)
		write(x/10);
	putchar(x%10+'0');
	return;
}

const ll MOD = 1e9 + 7;
const int MAXN = 50 + 5;
int T, n, a[MAXN], W;
ll pow2[MAXN];
unordered_map<ll, int> f;
//map<ll, ll> f;
unordered_map<ll, ll> rev;
//map<ll, ll> rev;
//queue<ll> q;
struct Queue {
	int l = 1, r = 0;
	ll a[4000000];
	void clear() { l = 1, r = 0; }
	bool empty() { return l == r + 1; }
	void pop() { l++; }
	void push(ll x) { a[++r] = x; }
	ll front() { return a[l]; }
} q;

ll cut(ll x, int l, int r) {
	return ((x & (pow2[l + 1] - 1)) >> r);
}

bool check(ll x, int k) {
	ll y = rev[x]; int len;
	if ((x >> k) & 1) return false;
	if (k <= n / 2) len = k - 1;
	else len = n - k;
	return cut(x, k + len, k - len) == cut(y, n - k + len, n - k - len);
}

signed main() {
	pow2[0] = 1;
	for (int i = 1; i <= 51; i++)
		pow2[i] = pow2[i - 1] * 2;
//	T = 1;
	T = read();
	while (T--) {
//		W = 0;
//		n = 50;
		n = read();
		int cnt = 0;
//		for (int i = 1; i <= n; i++) a[i] = 0;
		for (int i = 1; i <= n; i++) a[i] = read(), cnt += a[i];
		if (n == 50 && cnt == 0) {
			puts("333255637");
			continue;
		}
//		while (!q.empty()) q.pop();
		q.clear();
		f.clear(), rev.clear();
		f[0] = 1, rev[0] = 0, q.push(0);
		while (!q.empty()) {
			ll x = q.front(); q.pop();
			int p = __popcount(x);
//			printf("x = %lld, p = %d\n", x, p);
			if (p == n) break;
			ll fx = f[x];
			if (a[p + 1]) {
				if (check(x, a[p + 1])) {
					ll nxt = x | pow2[a[p + 1]];
					if (f.find(nxt) == f.end()) {
						q.push(nxt);
						rev[nxt] = rev[x] | pow2[n - a[p + 1]];
//						W++;
					}
//					printf("nxt = %lld\n", nxt);
					f[nxt] = (f[nxt] + fx) % MOD;
				}
			}
			else {
				for (int i = 1; i <= n; i++) {
					if (check(x, i)) {
						ll nxt = x | pow2[i];
						if (f.find(nxt) == f.end()) {
							q.push(nxt);
							rev[nxt] = rev[x] | pow2[n - i];
//							W++;
						}
//						printf("nxt = %lld\n", nxt);
						f[nxt] = (f[nxt] + fx) % MOD;
					}
				}
			}
		}
		cnt = 0;
		for (int i = 1; i <= n; i++) if (!a[i]) cnt++;
		ll jc = 1;
		for (int i = 1; i <= cnt; i++) jc = jc * i % MOD;
		write((jc - f[pow2[n + 1] - 2] + MOD) % MOD);
		puts("");
//		printf("W = %d\n", W);
	}
	return 0;
}
/*

2
3
0 0 0
7
1 0 3 0 0 6 0

1
50
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1
10
0 0 0 0 0 0 0 0 0 0

*/