#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int N = 5010;

long long fact[N], ifact[N];
long long ksm(long long x, long long y){
	long long re = 1;
	for (; y; y >>= 1){
		if(y & 1) re = re * x % MOD;
		x = x * x % MOD;
	}
	return re;
}

long long dp[N][N];
int tot[N], n;
void init(){
	for (int i = 0; i <= n + 1; ++ i, tot[i] = 0)
		for (int j = 0; j <= n + 1; ++ j) dp[i][j] = 0;
		
	fact[0] = 1;
	for (int i = 1; i <= n; ++ i) fact[i] = fact[i - 1] * i % MOD;
	
	ifact[n] = ksm(fact[n], MOD - 2);
	for (int i = n - 1; ~i; -- i) ifact[i] = ifact[i + 1] * (i + 1) % MOD;
}

long long C(int n, int m){if (m > n)return 0; return fact[n] * ifact[m] % MOD * ifact[n - m] % MOD;}

void solve(){
	cin >> n;
	init();
	
	for (int i = 1, x; i <= n; ++ i) cin >> x, ++ tot[x];
	
	dp[n + 1][0] = 1;
	for (int i = n, sum = 0; i; -- i){
		for (int add = 0; add <= (tot[i] >= 1); ++ add){
			int rest = tot[i] - add;
			for (int j = 0; j + add <= n / 2; ++ j){
				(dp[i][j + add] += dp[i + 1][j] * C(max(0, j - (sum - j) - (j != n / 2)), rest) % MOD) %= MOD;
//				cout << C(max(0, sum - j - (j != n / 2)), rest) << "\n";
			}
		}
		sum += tot[i];
	}
	cout << dp[1][n / 2] << "\n";
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
	
	int T; cin >> T;
	while(T --)solve();
}

/*
2
4
1 2 3 4
8
1 1 2 3 4 4 6 7
 */