#include <bits/stdc++.h>
using namespace std;
int po(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long md(long long a) {
  long long res = a % 1000000007;
  if (res < 0) res = res + 1000000007;
  return res;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n;
    int a[n];
    vector<int> v;
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] == 1) {
        cnt++;
      } else {
        v.push_back(cnt);
        cnt = 0;
      }
    }
    if (cnt > 0) v.push_back(cnt);
    if (cnt > 0) v.push_back(cnt);
    int w = 1;
    if (v.size() == 0)
      cout << "First\n";
    else if (v.size() >= 1 && v[0] != n) {
      if (v[0] % 2 == 1)
        cout << "Second\n";
      else
        cout << "First\n";
    } else {
      if (v[0] % 2 == 1) {
        cout << "First\n";
      } else
        cout << "Second\n";
    }
  }
}
