#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
//#define int long long
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PI = pair<pair<int,int>,int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using Tiib = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
    rep(i,ar.size()-1) cout << ar[i] << " ";
    cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
    rep(i,ar.size()){
        rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
        cout << ar[i][ar[0].size()-1] << endl;
    }
}
template <typename S>
bool range(S a, S b, S x){
    return (a <= x && x < b);
}

void yes(){
    cout << "Yes" << endl;
}

void no (){
    cout << "No" << endl;
}

ll cel (ll a, ll b){
    if (a % b == 0) return a / b;
    else return a / b + 1;
}

ll gcds(ll a, ll b){
    ll c = a % b;
    while (c != 0){
        a = b;
        b = c;
        c = a % b;
    }
    return b;
}

ll len(vector<PL> &ar, ll kg){
    int l = ar.size();
    if (kg < ar[0].first) return 0LL;
    if (kg >= ar[l-1].first) return ar[l-1].second;
    int le = 0;
    int ri = l-1;
    int mid = (le + ri) / 2;
    while (true){
        if (ar[mid].first <= kg && kg < ar[mid+1].first) return ar[mid].second;
        if (kg < ar[mid].first) ri = mid;
        else le = mid;
        mid = (le + ri) / 2;
    }
}

int main(){
    int t; cin >> t;
    vector<string> ans(t);
    rep(i,t){
        int n; cin >> n;
        map<int,int> m;
        map<int,int> ::iterator ite;;
        rep(i,n){
            int a; cin >> a;
            if (m.find(a) == m.end()) m[a] = 1;
            else m[a]++;
        }
        if (n % 2 == 1) ans[i] = "Second";
        else {
            bool t = true;
            for (ite = m.begin(); ite != m.end(); ite++){
                if (ite->second % 2 == 1) t = false;
            }
            if (t) ans[i] = "Second";
            else ans[i] = "First";
        }
    }
    rep(i,t) cout << ans[i] <<endl;
}
#include<cstdio>
#include<cctype>
#include<set>
#include<map>
using namespace std;
typedef map<int,int>::iterator Mit;
template<class T>
void read(T& x)
{
    x=0;
    int f=1,ch=getchar();
    while(!isdigit(ch)){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(isdigit(ch)){
        x=x*10+ch-'0';
        ch=getchar();
    }
    x*=f;
}
int t,n;
set<int> a;
map<int,int> b;
int main()
{
    read(t);
    while(t--)
    {
        read(n);
        int x=0,y;
        b.clear();
        for(int i=0;i<n;i++)
        {
            read(y);
            b[y]++;
        }
        Mit it=b.begin();
        for(it;it!=b.end();it++)
            if(it->second&1) {
                x=1;
                break;
            }
        if(x^(n&1)) puts("First");
        else puts("Second");
    }
    return 0;
}
