// author: erray
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }
    if (n % 2 == 1) {
      cout << "Second";
    } else {
      sort(a.begin(), a.end());
      bool ok = true;
      for (int i = 0; i < n; i += 2) {
        ok &= (a[i] == a[i + 1]);
      }
      cout << (ok ? "Second" : "First");
    }
    cout << '\n';
  }
}

// Problem : D - Let's Play Nim
// Contest : AtCoder - AtCoder Regular Contest 105
// URL : https://atcoder.jp/contests/arc105/tasks/arc105_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
//krishrawat 
 
 
//----------------------------MACROS-------------------------------------------------
#define pb insert//                                                                 |
#define eb emplace_back//                                                           |
#define ff first//                                                                  |
#define ss second//                                                                 |
typedef long long int ll;//                                                         |
typedef long double ld;//                                                           |
#define all(a) a.begin(), a.end()//                                                 |
#define show(x) cerr << #x << " is " << x << "\n"//                                 |
#define show2(x, y) cerr << #x << " " << #y << " " << x << " " << y << "\n"//       |
typedef vector<ll> vl;//                                                            |
typedef vector<vl> vvl;//                                                           |
typedef pair<ll, ll> pp;//                                                          |
typedef vector<pp> vp;//                                                            |
typedef map<pp, ll> ipi;//                                                          |
typedef map<pp, char> ipc;//                                                        |
typedef map<ll, ll> ii;//                                                           |
typedef set<ll> sl;//                                                               |
typedef multiset<ll> msl;//                                                         |
typedef map<char, ll> ci;//                                                         |
typedef set<pair<ll, ll>> sp;//                                                     |
const ll mod = 1e9 + 7;//                                                           |
const ll N = 1e6 + 1;//                                                             |
//----------------------------------------------------------------------------------
 
 
void solve(){
    ll n;cin>>n;
    ii m;
    for(int i=0;i<n;i++){
    	ll k;cin>>k;
    	m[k]++;
    }
    int f=0;
    for(auto i:m){
    	if(i.ss%2) f=1;
    }
    if(n%2){
    	f=!f;
    }
    if(!f) cout<<"Second\n";
    else cout<<"First\n";
}
 
int main()
{	
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
    ll t;cin>>t;
    while(t--) solve();
	return 0;
}