//g++ 2.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>;

#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--)

void solve(){
  int n;
  cin>>n;

  vll a(n);
  ll sum=0;
  rep(i,0,n){
    cin>>a[i];
    sum+=a[i];
  }

  sort(all(a));

  if((sum-n)%2==1){
    cout<<"First\n";
    return;
  }

  if(a[0]==1||n%2==1){
    cout<<"Second\n";
    return;
  }

  if(a[0]%2==0){
    cout<<"First\n";
    return;
  }

  cout<<"Second\n";
  return;
}

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

  int t;
  cin>>t;

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