#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

const ll MOD=1000000007;
//~ const int MOD=998244353;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;

int a[200000];

int main(){
	int T;cin>>T;
	rep(Case,T){
		int n;scanf("%d",&n);
		map<int,int>mp;
		rep(i,n)scanf("%d",&a[i]),mp[a[i]]++;
		bool ok=true;
		for(auto&p:mp){
			if(p.second%2!=0)ok=false;
		}
		if(n%2==1){
			puts("Second");
		}
		else{
			if(ok)puts("Second");
			else puts("First");
		}
	}
}
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f

using namespace std;

int t;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    cin>>t;
    while(t--){
        int n; cin>>n;
        vector<lint> a(n);
        map<int,int> cont;
        for(auto &x:a) cin>>x, cont[x]++;
        lint xo = a[0];
        bool Grone = false;
        if(a[0] > 1) Grone = true;
        for(int i=1; i<n;i++){
             xo ^= a[i];
             if(a[i] > 1) Grone = true;
        }
        if(n%2 == 0){
            string win = "Second\n";
            for(auto &e:cont) if(e.nd%2) win = "First\n";
            cout<<win;
        } else{
            cout<<"Second\n";
        }
    }

    return 0;
}
/*
    num par de dishes:
        quero forçar xor de todo mundo != 0
            nd -> me imita
            st -> não me imita


    num ímpar de dishes:
        quero forçar xor de todo mundo == 0
            n == 2
            1 1 ->> 2 0
            1 2 -> 1 2
            1 1 2 2 -> 2 2 
            carinha mau força




*/