#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;
        std::vector<int> a(n);
        for (int i = 0; i < n; ++i) std::cin >> a[i];
        if (n % 2 == 1) {
            std::cout << "Second\n";
        } else {
            std::sort(a.begin(), a.end());
            bool win = false;
            for (int i = 0; i < n; i += 2) win |= a[i] != a[i + 1];
            std::cout << (win ? "First" : "Second") << "\n";
        }
    }
    
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

const long long int MOD = 998244353;
 
void solve() {
	int n; cin >> n;
  	vector<int> a(n);
  	long long int sum = 0;
  	for (int i = 0; i < n; i++) {
    	cin >> a[i];
      	sum += a[i];
    }
  
  	if (sum % 2) {
    	cout << 0;
      	return;
    }
  
    vector<long long int> f(n + 1, 1);
  	vector<vector<long long int>> dp(sum + 1, vector<long long int>(n + 1, 0));
  	dp[0][0] = 1;
    for (int i = 1; i <= n; i++)
        f[i] = f[i - 1] * i % MOD;
  
    for (int i = 0; i < n; i++) {
        for (int j = n; j > 0; j--) {
            for (int k = sum; k >= a[i]; k--) {
                dp[k][j] += dp[k - a[i]][j - 1];
                dp[k][j] %= MOD;
            }
        }
    }

    long long int ans = 0;
    for (int i = 0; i <= n; i++) {
        ans += dp[sum / 2][i] * f[i] % MOD * f[n - i] % MOD;
        ans %= MOD;
    }
    cout << ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

	int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}