#include <bits/stdc++.h>
using namespace std;
void dfs(long long u, vector<vector<long long> >& adj, vector<bool>& vis) {
  vis[u] = true;
  for (auto v : adj[u])
    if (!vis[v]) dfs(v, adj, vis);
}
int32_t main() {
  long long t = 1;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long flag = -1;
    long long a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] != 1 && flag == -1) {
        flag = i;
      }
    }
    if (flag == -1) {
      if (n % 2) {
        cout << "First";
      } else
        cout << "Second";
    } else {
      if ((flag - 0 + 1) % 2) {
        cout << "First";
      } else
        cout << "Second";
    }
    cout << endl;
  }
  return 0;
}
