#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
void test() {
	vector<int>dp(100);
	dp[1] = 0;
	dp[2] = 1;
	rep2(i, 3, 100) {
		dp[i] = 1;
		rep2(j, 1, i) {
			int k = i - j;
			if (dp[j] && dp[k])dp[i] = 0;
		}
	}
	rep(i, 100) {
		cout << i << " " << dp[i] << endl;
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	//test();
	int t; cin >> t;
	vector<int>g = { 0,0,1,1,0 };
	while (t--) {
		int n; cin >> n;
		int x = 0;
		rep(i, n) {
			long long a; cin >> a;
			a %= 5;
			x ^= g[a];
		}
		cout << (x ? "First" : "Second") << endl;
	}
	return 0;
}