import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  debug {{
    bool[string] cache;
    bool calc(int[] as) {
      const key = as.to!string;
      auto ptr = key in cache;
      if (ptr) return *ptr;
      
      bool ret;
      const asLen = cast(int)(as.length);
      foreach (i; 0 .. asLen) if (as[i] >= 2) {
        foreach (x; 1 .. as[i] / 2 + 1) {
          auto bs = as.dup;
          bs[i] = x;
          bs ~= as[i] - x;
          bs.sort;
          if (!calc(bs)) {
            ret = true;
            break;
          }
        }
      }
      if (!ret) {
        bool ok = true;
        foreach (i; 0 .. asLen) {
          ok = ok && (as[i] >= 2);
        }
        if (ok) {
          auto bs = as.dup;
          bs[] -= 1;
          if (!calc(bs)) {
            ret = true;
          }
        }
      }
      return cache[key] = ret;
    }
    
    enum lim = 8 + 1;
    foreach (a; 1 .. lim) {
      writeln([a], ": ", calc([a]));
    }
    foreach (a; 1 .. lim) foreach (b; a .. lim) {
      writeln([a, b], ": ", calc([a, b]));
    }
    foreach (a; 1 .. lim) foreach (b; a .. lim) foreach (c; b .. lim) {
      writeln([a, b, c], ": ", calc([a, b, c]));
    }
    foreach (a; 1 .. lim) foreach (b; a .. lim) foreach (c; b .. lim) foreach (d; c .. lim) {
      // writeln([a, b, c, d], ": ", calc([a, b, c, d]));
      if (!calc([a, b, c, d])) {
        writeln([a, b, c, d]);
      }
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        auto A = new long[N];
        foreach (i; 0 .. N) {
          A[i] = readLong;
        }
        A.sort;
        
        bool ans;
        
        ans = ans || (N % 2 == 0 && A[0] % 2 == 0);
        
        int cnt;
        foreach (i; 0 .. N) {
          if (A[i] % 2 == 0) {
            ++cnt;
          }
        }
        ans = ans || (cnt % 2 != 0);
        
        writeln(ans ? "First" : "Second");
      }
    }
  } catch (EOFException e) {
  }
}