#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a) 
#define dumparr(a,n) 
#endif
#define FOR(i, a, b) for(ll i = (ll)a;i < (ll)b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(ll i = (ll)b-1LL;i >= (ll)a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define SIGN(a) (a==0?0:(a>0?1:-1))

typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<ld,ld> pdd;

pll operator+(pll a,pll b){
  return pll(a.first+b.first,a.second+b.second);
}
pll operator-(pll a,pll b){
  return pll(a.first-b.first,a.second-b.second);
}
pll operator*(ll a,pll b){
  return pll(b.first*a,b.second*a);
}
const ll INF=(1LL<<60);
#if __cplusplus<201700L
ll gcd(ll a, ll b) {
  a=abs(a);
  b=abs(b);
  if(a==0)return b;
  if(b==0)return a;
  if(a < b) return gcd(b, a);
  ll r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}
#endif
template<class T>
bool chmax(T& a,const T& b){
  if(a<b){
    a=b;
    return true;
  }
  return false;
}
template<class T>
bool chmin(T& a,const T& b){
  if(a>b){
    a=b;
    return true;
  }
  return false;
}
template<class S,class T>
std::ostream& operator<<(std::ostream& os,pair<S,T> a){
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,vector<T> a){
  os << "[ ";
  REP(a.size()){
    os<< a[i] << " ";
  }
  os<< " ]";
  return os;
}

const string First = "First";
const string Second = "Second";

int main(){
  cout<<setprecision(1000);
  ll T;
  cin>>T;
  For(times,T){
    ll N;
    cin>>N;
    vector<ll> A(N);
    REP(N)cin>>A[i];
    if(N%2){
      cout<<Second<<endl;
    }else{
      map<ll,ll> cnt;
      REP(N){
        cnt[A[i]]+=1;
      }
      bool f = false;
      for (auto &&i : cnt)
      {
        if(i.second%2){
          f=true;
        }
      }
      if(f){
        cout<<First<<endl;
      }else{
        cout<<Second<<endl;
      }
    }
  }
    return 0;
}

#include <iostream>
#include <set>
#include <queue>
#include <limits>
#include <string.h>
#include <algorithm>
#include <map>
#define INF 0x3f3f3f3f
#define LL long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int a[200010];
map<int,int>mm;
int main(){
	int t;
	cin>>t;
	while(t--){
		mm.clear();
		int n;
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			mm[a[i]]++;
		}
		if(n&1)puts("Second");
		else{
			int flg=0;
			for(auto it=mm.begin();it!=mm.end();it++){
				if(it->S&1){
					flg=1;
					break;
				}
			}
			if(flg)puts("First");
			else puts("Second");
		}
	}
	return 0;
}