#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+100;
#define fr(i,a,b) for(int i = a;i <= b; ++i)
#define nfr(i,a,b) for(int i = a;i >= b; --i)

int n,m;
int t;
int a[N];

map<int,int> m1;

void solve(){
   m1.clear();
   scanf("%d",&n);
   fr(i,1,n)scanf("%d",a+i);

   int res1 = 0,res2 = 0;
   fr(i,1,n){
      res1 ^= a[i]; m1[a[i]] ^= 1;
   }

   fr(i,1,n)res2 |= m1[a[i]];
   if(res1){
      if(n%2 == 0)puts("First");
      else puts("Second");
   } else if(res2){
      if(n%2 == 0)puts("First");
      else puts("Second");
   } else {
      if(n%2 == 0)puts("Second");
      else puts("First");
   }
   return ;
}

int main(){
   scanf("%d",&t);
   while(t--)solve();
}

#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
//const ll mod = 1000000007;

void solve() {
    ll N;
    cin >> N;
    map<ll, ll> mp;
    for(int i = 0; i < N; i++) {
        ll a;
        cin >> a;
        mp[a]++;
    }
    if(N % 2 == 1) {
        cout << "Second" << endl;
        return;
    }
    for(auto tmp : mp) {
        if(tmp.second % 2 == 1) {
            cout << "First" << endl;
            return;
        }
    }
    cout << "Second" << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll T;
    cin >> T;
    while(T--) solve();
    return 0;
}
