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 int binexp(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a;
    a = a * a;
  }
  return ans;
}
long long int modexp(long long int a, long long int b, long long int m) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans = ans * a % m;
    }
    a = a * a % m;
  }
  return ans % m;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      a.push_back(x);
    }
    int k = 0;
    int winner = 1;
    int c = 1;
    while (true) {
      if (c == 1) {
        if (k == n - 1) break;
        if (a[k] == 1) {
          k++;
        } else if (a[k] > 1) {
          winner = 1;
          break;
        }
        c = 2;
      }
      if (k > n) break;
      if (c == 2) {
        if (k == n - 1) {
          winner = 2;
          break;
        }
        if (a[k] > 1) {
          winner = 2;
          break;
        }
        if (a[k] == 1) k++;
        c = 1;
      }
    }
    if (winner == 1)
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  }
}
