#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<map>
using std::cin;using std::cerr;
using std::max;using std::min;
#define N 100005
#define ll long long
#define db double
#define dbg1(x) cerr<<#x<<"="<<(x)<<" "
#define dbg2(x) cerr<<#x<<"="<<(x)<<"\n"
int T,n,A[N];ll Sum1,Sum2;
int main()
{
	for(scanf("%d",&T);T--;Sum1=Sum2=0)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++) scanf("%d",&A[i]);
		std::sort(A+1,A+1+n);
		if(n&1)
		{
			for(int i=2;i<=n;i++) i&1?Sum1+=A[i]:Sum2+=A[i];
			Sum1+=A[1];
			puts(Sum1^Sum2?"Second":"First");
		}
		else
		{
			for(int i=1;i<=n;i++) i&1?Sum1+=A[i]:Sum2+=A[i];
			puts(Sum1^Sum2?"First":"Second");
		}
	}
	return 0;
}
#include<bits/stdc++.h>
#define rint register int 
using namespace std;
int n,a[1010000];
int main(){
	int T;
	cin>>T;
	while(T--) {
		cin>>n;
		for(rint i=1;i<=n;++i) cin>>a[i];
		sort(a+1,a+n+1);
		if(n&1) {cout<<"Second\n";}
		else {
			int fl=0;
			for(rint i=2;i<=n;i+=2){
				if(a[i]!=a[i-1]) {cout<<"First\n",fl=1;break;}
			} 
			if(!fl) cout<<"Second\n";
		}
	}
	return 0;
} 