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;
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n, sum = 0, fg = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
      int t;
      scanf("%d", &t);
      if (fg == 0 && t == 1)
        sum++;
      else
        fg = 1;
    }
    if (fg == 0 && sum % 2)
      printf("First\n");
    else if (fg && sum % 2 == 0)
      printf("First\n");
    else
      printf("Second\n");
  }
  return 0;
}
