#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void INT(T &n) {
  n = 0;
  int f = 1;
  int ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';
  n = n * f;
}
template <typename T>
T gcd(T a, T b) {
  return !b ? a : gcd(b, a % b);
}
template <typename T>
inline void umin(T &a, T b) {
  a = a < b ? a : b;
}
template <typename T>
inline void umax(T &a, T b) {
  a = a > b ? a : b;
}
template <typename T, typename W>
inline void INT(T &x, W &y) {
  INT(x), INT(y);
}
template <typename T, typename W, typename Q>
inline void INT(T &x, W &y, Q &z) {
  INT(x, y), INT(z);
}
const int N = 1e5 + 7;
const int inf = 1e9 + 7;
int solve() {
  int n;
  INT(n);
  vector<int> a(n);
  for (int &x : a) {
    INT(x);
  }
  string finisher = "second";
  for (int i = n - 2; i > 0; --i) {
    if (finisher == "second") {
      if (a[i] == 1) {
        finisher = "first";
      }
    } else {
      finisher = "second";
    }
  }
  if (n == 1 | finisher == "first" || (finisher == "second" && a[0] > 1)) {
    printf("First\n");
  } else {
    printf("Second\n");
  }
  return 0;
}
int main() {
  int tests = 1, CaseNo = 0;
  INT(tests);
  while (tests--) {
    solve();
  }
  return 0;
}
