#include <bits/stdc++.h>
using namespace std;
const long long INF = 2000000000000000000LL;
const int inf = 0x3f3f3f3f;
long long MOD = 1e9 + 7;
const long double EPS = 1e-9;
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline double my_sqrt(T n) {
  double high = n, low = 0, mid, ans;
  int cnt = 100;
  while (cnt--) {
    mid = low + (high - low) / 2;
    if (mid * mid <= n)
      ans = mid, low = mid;
    else
      high = mid;
  }
  return ans;
}
template <class T>
inline T bigmod(T b, T p) {
  if (p <= 0) return 1;
  if (p & 1) return (b * bigmod(b, p - 1)) % MOD;
  long long x = bigmod(b, p >> 1);
  return (x * x) % MOD;
}
const int maxn = 1e5;
int arr[maxn + 5], n;
int main() {
  int test;
  scanf("%d", &test);
  ;
  while (test--) {
    scanf("%d", &n);
    ;
    int indx = -1, ck = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &arr[i]);
      ;
      if (arr[i] == 1 && ck == 0) {
        indx = i;
      } else
        ck = 1;
    }
    if (indx == -1 || indx == n - 1) {
      if (indx == -1)
        puts("First");
      else if (n % 2)
        puts("First");
      else
        puts("Second");
    } else {
      if (indx % 2)
        puts("First");
      else
        puts("Second");
    }
  }
  return 0;
}
