#include <bits/stdc++.h>
using namespace std;
long long int bigmod(long long int a, long long int b) {
  if (b == 0) {
    return 1;
  }
  long long int tm = bigmod(a, b / 2);
  tm = (tm * tm) % 1000000007;
  if (b % 2 == 1) tm = (tm * a) % 1000000007;
  return tm;
}
int egcd(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int d = egcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cout << setprecision(10) << fixed;
  ;
  solve();
  return 0;
}
void solve() {
  int t;
  cin >> t;
  for (int i = 0; i < int(t); i++) {
    int n;
    cin >> n;
    int a[n];
    int ind = n, f = 0, c = 0, f1 = 1;
    for (int j = 0; j < int(n); j++) {
      cin >> a[j];
      if (a[j] == 1 && f == 0)
        c++;
      else
        f = 1;
    }
    if (c == 0 || (c % 2 == 0 && c != n) || (c % 2 == 1 && c == n))
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  }
}
