#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll _;cin>>_;
  
 // const ll L=100;
 // vvvb DP(L,vvb(L,vb(L)));
 // rep(a,1,L)rep(b,1,L)rep(c,1,L){
 // 	bool p=1,q=1,r=1;
 // 	rep(x,1,a)if(DP[x][b][c]&&DP[a-x][b][c])p=0;
 // 	rep(y,1,b)if(DP[a][y][c]&&DP[a][b-y][c])q=0;
 // 	rep(z,1,c)if(DP[a][b][z]&&DP[a][b][c-z])r=0;
 // 	if(a<2)p=0;
 // 	if(b<2)q=0;
 // 	if(c<2)r=0;
	// DP[a][b][c]=(p||q||r);
 // }
 // rep(a,1,L)rep(b,1,L)rep(c,1,L)if(!DP[a][b][c])cout<<a<<" "<<b<<" "<<c<<endl;
  
  while(_--){
  	ll N;cin>>N;
  	vl A(N);cin>>A;
  	ll a=0,b=0,c=0;
  	for(auto x:A){
  		if(x==3)a++;
  		else if(x%5==2||x%5==3)b++;
  	}
  	if(a%2+b%2==0)cout<<"Second"<<endl;
  	else cout<<"First"<<endl;
  }
  return 0;
}