#include <bits/stdc++.h>  // clang-format off
using namespace std;
using i64 = int64_t;
using pii = pair<i64, i64>;
#define rep(i, n) for (i64 i = 0; i < i64(n); i++)
#define per(i, n) for (i64 i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (i64 i = a; i < i64(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#ifdef LOCAL
#define dbg(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debug(__VA_ARGS__)
#else
#define dbg(...)
#endif
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
    os << '(' << pa.first << ',' << pa.second << ')'; return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    for (auto& x : vec) { os << x << ' '; } return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &mat) {
    os << endl; for (auto& vec : mat) { os << vec << endl; } return os;
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head H, Tail... T) {
    cerr << " " << H; debug(T...);
}
template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1 << 30) - 1;
const i64 LINF = (1LL << 60) - 1;
// clang-format on

template <typename T>
vector<T> compress(vector<T>& vec) {
    auto ret = vec;
    sort(all(vec));
    vec.erase(unique(all(vec)), vec.end());
    for (T& a : ret) a = lower_bound(all(vec), a) - vec.begin();
    return ret;
}

void solve() {
    int n;
    cin >> n;
    vector<i64> A(n);
    rep(i, n) cin >> A[i];
    auto X = compress(A);
    vector<int> cnt(X.size());
    rep(i, n) {
        cnt[X[i]]++;
    }
    if (n % 2 == 0) {
        bool latter = 1;
        for (auto x : cnt) {
            latter &= x % 2 == 0;
        }
        cout << (latter ? "Second" : "First") << endl;
    }
    else {
        cout << "Second" << endl;
    }
}

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

#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll, ll>
using namespace std;

int main(){
  int n; cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  ll ans = 1e18;
  for(ll i = 0; i <= 1 << (n - 1); i++){
    ll x = 0, y = 0;
    vector<ll> v;
    rep(j, n){
      x |= a[j];
      if(j == n - 1) break;
      if(i >> j & 1){
        v.push_back(x);
        x = 0;
      }
    }
    v.push_back(x);
    for(auto& e: v){
      y ^= e;
    }
    ans = min(ans, y);
  }
  cout << ans << endl;
  return 0;
}
