#include<iostream>
#include<cstdio>
#include<vector>
#define N 2000
#define mod 998244353
using namespace std;
const int inv2=(mod+1)>>1;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int T,n,length,ans,ans2,a[N+1],F[N+1];
bool E[N+1][N+1];
vector<int>p[N+1];
vector<int>num[N+1];
int main()
{
	int res,l,r,l2,r2;
	F[0]=1;
	for (int i=1;i<=N;++i) F[i]=MD(F[i-1]+1ll*(i-1)*F[i-2]%mod);
	T=read();
	while (T--)
	{
		n=read(),ans=1,ans2=length=0;
		for (int i=1;i<=n;++i) p[i].clear();
		for (int i=1;i<=n;++i) a[i]=read(),p[a[i]].push_back(i);
		for (int i=1;i<=n;++i) ans=1ll*ans*F[p[i].size()]%mod;
		for (int i=1;i<=n;++i)
			for (int j=i+1;j<=n;++j)
				E[i][j]=0;
		for (int i=1;i<=n;++i)
		{
			num[i].resize(p[i].size());
			for (int j=0;j+1<p[i].size();++j) num[i][j]=++length;
		}
		for (int i=1;i<=n;++i)
			for (int j=i+1;j<=n;++j)
			{
				for (int k=0;k<p[i].size();++k)
					for (int t=0;t<p[j].size();++t)
						if (p[i][k]<p[j][t])
						{
							if (k+1==p[i].size()) l=0,r=k-1;
							else l=r=k;
							if (t+1==p[j].size()) l2=0,r2=t-1;
							else l2=r2=t;
							for (int s=l;s<=r;++s)
								for (int w=l2;w<=r2;++w)
								{
									if (num[i][s]<num[j][w]) E[num[i][s]][num[j][w]]^=1;
									else E[num[j][w]][num[i][s]]^=1;
								}
						}
			}
		for (int i=0;i<(1<<length);++i)
		{
			res=1;
			for (int j=1;j<=length;++j)
				if ((i>>(j-1))&1)
					for (int k=j+1;k<=length;++k)
						if (((i>>(k-1))&1)&&E[j][k])
							res=MD2(-res);
			Adder(ans2,res);
		}
		printf("%lld\n",1ll*(ans+ans2)*inv2%mod);
	}
	return 0;
}