// 誤答例

//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

void solve(){
  int n;
  ll s=0,a_min=2e18;
  cin>>n;

  rep(i,0,n){
    ll a;
    cin>>a;
    s+=a;
    a_min=min(a_min,a);
  }

  if((s-n)%2==1){
    cout<<"First\n";
  }
  else if((s-n)%2==0&&n%2==0&&a_min%2==0){
    //cout<<"First\n";
    // 誤答例
    cout<<"Second\n";
  }
  else{
    cout<<"Second\n";
  }
  return;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin>>t;

  while(t--){
    solve();
  }
}