#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int T,n,p[200010],ans=1,ok;
bool solve(int l,int r){
	if((r-l+1)&1)return 1;
	int u=l;
	while(u<r&&p[u+1]==p[l])
		u++;
	if(u==r){
		return 0;
	}else{
		return solve(u+1,r)^((p[l]-p[l-1]+1)%2)^((u-l+1)%2);
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>T;
	while(T--){
		cin>>n;
		ok=0;
		for(int i=1;i<=n;i++)
			cin>>p[i];
		sort(p+1,p+n+1);
		if(solve(1,n)){
			cout<<"First\n";
		}else{
			cout<<"Second\n";
		}
	}
	return 0;
}