#include <bits/stdc++.h>
bool solve(long int stones[], int n, int pile) {
  if (pile == (n - 1))
    return true;
  else if (stones[pile] == 1)
    return !(solve(stones, n, pile + 1));
  else
    return (true || solve(stones, n, pile + 1));
}
int main() {
  int testCase = 0, n = 0;
  long int stones[100001];
  scanf("%d", &testCase);
  getchar();
  for (int i = 0; i < testCase; i++) {
    scanf("%d", &n);
    getchar();
    for (int j = 0; j < n; j++) {
      scanf("%ld", &stones[j]);
      getchar();
    }
    if (solve(stones, n, 0)) {
      printf("First\n");
    } else {
      printf("Second\n");
    }
  }
  return 0;
}
