#include<bits/stdc++.h>
#define int __int128
#define N 55
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define M 1000000007
using namespace std;
int n,cn,T,vs[N],p[N];
int rev(int n) {
    n = (n & 0xaaaaaaaa) >> 1 | (n & 0x55555555) << 1;
    n = (n & 0xcccccccc) >> 2 | (n & 0x33333333) << 2;
    n = (n & 0xf0f0f0f0) >> 4 | (n & 0x0f0f0f0f) << 4;
    n = (n & 0xff00ff00) >> 8 | (n & 0x00ff00ff) << 8;
    n = (n & 0xffff0000) >> 16 | (n & 0x0000ffff) << 16;
    return n >> 32 | n << 32;
}namespace io {
	const int __SIZE = (1 << 21) + 1;
	char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, _eof;
	#define Gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	inline void flush () { fwrite (obuf, 1, oS - obuf, stdout), oS = obuf; }
	inline void gc (char &x) { x = Gc(); }
	inline void pc (char x) { *oS ++ = x; if (oS == oT) flush (); }
	inline void pstr (const char *s) { int __len = strlen(s); for (__f = 0; __f < __len; ++__f) pc (s[__f]); }
	inline void gstr (char *s) { for(__c = Gc(); __c < 32 || __c > 126 || __c == ' ';)  __c = Gc();
		for(; __c > 31 && __c < 127 && __c != ' ' && __c != '\n' && __c != '\r'; ++s, __c = Gc()) *s = __c; *s = 0; }
	template <class I> inline bool gi (I &x) { _eof = 0;
		for (__f = 1, __c = Gc(); (__c < '0' || __c > '9') && !_eof; __c = Gc()) { if (__c == '-') __f = -1; _eof |= __c == EOF; }
		for (x = 0; __c <= '9' && __c >= '0' && !_eof; __c = Gc()) x = x * 10 + (__c & 15), _eof |= __c == EOF; x *= __f; return !_eof; }
	template <class I> inline void print (I x) { if (!x) pc ('0'); if (x < 0) pc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10; while (qr) pc (qu[qr --]); }
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
} using io::pc; using io::gc; using io::pstr; using io::gstr; using io::gi; using io::print;
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};  map<int,int>f;
void inc(int &x,int y){x+=y; if(x>=M) x-=M;}
int clc(int S,int l,int r){return (S&((1ll<<(r+1))-1))>>l;}
bool chk(int S,int i){
	if(S>>i&1) return 0; int va=min(i,n-i-1);
	return clc(S,i-va,i-1)==(rev(clc(S,i+1,i+va))>>(64-va));
}void slv(){
	int cn=0; gi(n); f.clear(),memset(vs,0,sizeof(vs)),f[0]=1; 
	for(int i=0;i<n;i++) gi(p[i]),(~(--p[i]))&&(vs[p[i]]=1),cn+=(p[i]==-1);
	for(auto u:f){
		int va=p[__builtin_popcountll((long long)u.fi)];
		if(va!=-1) {if(u.se&&chk(u.fi,va)) inc(f[u.fi^(1ll<<va)],u.se);}
		else for(int t=0;t<n;t++) if(!vs[t]&&u.se&&chk(u.fi,t)) inc(f[u.fi^(1ll<<t)],u.se);
	}int mul=1;
	for(int i=cn;i;i--) mul=mul*i%M; print((mul+M-f[(1ll<<n)-1])%M),pc('\n');
}signed main(){
	gi(T); while(T--) slv();
	return 0;
}