1
2 2
1 1
1 2
 1
1 3
3
1 2 3
 1
1 1
1000
1000
 1
2 2
2 2
2 2
 5
4 5
10 8 6 4
1 2 3 4 5
1 1
3
3
1 1
3
2
5 3
1000 2 2 2 3
3 1 5
5 5
1 2 3 4 5
1 2 3 4 5
 1
4 4
1 1 1 1
1 2 3 4
 1
2 3
1 1
1 2 3

YES
1 1
 YES
1 3
 YES
1 1000
 YES
1 2
 YES
1 4
YES
1 3
NO
YES
1 3
YES
1 1
 YES
1 1
 YES
1 1

#include <bits/stdc++.h>
using namespace std;
long long t, n, i, j, k, a, b, c, m, l, r, p, q, s;
void dihan() {
  a = 0;
  b = 0;
  cin >> n;
  vector<long long> x(n);
  for (auto &i : x) cin >> i;
  for (i = 0; i < n; i++)
    if (x[i] > 1)
      break;
    else if (x[i] > 0)
      b++;
  if (b % 2 > 0)
    puts(i < n ? "Second" : "First");
  else
    puts(i < n ? "First" : "Second");
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cin >> t;
  while (t--) dihan();
}
