/* -*- coding: utf-8 -*-
 *
 * 1852.cc:  No.1852 Divide or Reduce - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

enum { First, Second };

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];

/* subroutines */

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);

    ll sum = 0;
    for (int i = 0; i < n; i++) scanf("%d", as + i), sum += as[i];

    int ans;
    if ((sum - n) & 1) ans = First;
    else {
      if (n & 1) ans = Second;
      else {
	int mina = *min_element(as, as + n);
	ans = (mina & 1) ? Second : First;
      }
    }

    if (ans == First) puts("First");
    else puts("Second");
  }

  return 0;
}