// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,c[maxn],a[maxn];
modint f[maxn];

bitset<4005>bs[4005],tmp,tmp1;
bool del[4005];
modint solve(int n)
{
	modint res=1;
	For(i,1,n)del[i]=0;
	For(i,1,n){
		if(del[i])continue;
		tmp.reset();
		int v=0,o=0;
		For(j,i+1,n)
			if(bs[i][j]&&!del[j]){
				if(!v)v=j;
				o+=bs[i][j],tmp[j]=1;
			}
		if(!o){
			if(bs[i][i])return 0;
			res*=2;
			continue;
		}
		res*=2;
		tmp1.reset();
		tmp[v]=tmp[i]=0;
		if(bs[v][v]){
			if(bs[i][i]) res=-res;
			For(j,i+1,n) if(bs[i][j] && j!=v) bs[j][j]=bs[j][j]^1;
		}
		For(j,i+1,n){
			if(bs[v][j]){
				if(j!=v && !del[j]) tmp1[j]=1;
				if(bs[v][j]&&bs[i][i]) bs[j][j]=bs[j][j]^1;
			}
		}
		For(j,1,n)if(tmp1[j]) bs[j]^=tmp;
		For(j,1,n)if(tmp[j]) bs[j]^=tmp1;
		For(j,1,n)if(tmp[j]&&tmp1[j]) bs[j][j]=bs[j][j]^1;
		del[v]=1;
	}
	return res;
}

void work()
{
	n=read();
	For(i,1,n+n)bs[i].reset(),c[i]=0;
	For(i,1,n)a[i]=read(),++c[a[i]],bs[a[i]+n][i]=bs[i][a[i]+n]=1;
	For(i,1,n)For(j,i+1,n)bs[i][j]=bs[j][i]=(a[i]>a[j]);
	modint res=solve(n+n);
	res*=qpow((mod+1)/2,n);
	modint sum=1;
	For(i,1,n)sum*=f[c[i]];
	res=(res+sum)*((mod+1)/2);
	cout<<res.x<<"\n";
}

signed main()
{
	f[0]=f[1]=1;
	For(i,2,4000)f[i]=f[i-1]+f[i-2]*(i-1);
	int T=read();
	while(T--)work();
	return 0;
}