#include <bits/stdc++.h>
using namespace std;
int t, n, pile[100002];
bool b;
int main() {
  cin >> t;
  for (int w = 0; w < t; w++) {
    b = 1;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> pile[i];
    }
    int p1 = 0;
    while (pile[p1] == 1 && p1 < n) {
      p1++;
      b = !b;
    }
    if (p1 == n) {
      b = !b;
    }
    if (b == 1) {
      cout << "First\n";
    } else {
      cout << "Second\n";
    }
  }
  return 0;
}
