from collections import defaultdict, deque, Counter
from heapq import heapify, heappop, heappush
import math
from copy import deepcopy
from itertools import combinations, permutations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right

import sys

def input():
    return sys.stdin.readline().rstrip()
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getListGraph():
    return list(map(lambda x:int(x) - 1, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]

mod = 10 ** 9 + 7
MOD = 998244353
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10000000)
inf = float('inf')
eps = 10 ** (-15)
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]

#############
# Main Code #
#############

"""
先手はX, Y両方試せる
どこかの山を1とA[i] - 1に分割したらその後はXしか行えない
A[i] - 1の総和が奇数なら後手に偶数個で渡せてXを交互に行うことで先手が勝てる
偶数の場合は操作Yを行い偶数個取り除ければ安全に渡せる
後手も同じ操作を行い先手に渡す
Yを行える回数が奇数なら先手の勝ち
"""

T = getN()
for _ in range(T):
    N = getN()
    A = getList()

    X = 0
    Y = inf
    for a in A:
        X += a - 1
        Y = min(Y, a)
    Y -= 1

    # Xの操作回数が奇数なら
    if X % 2 != 0:
        print('First')
    else:
        # 偶数個引け、かつ奇数回施行できる
        if N % 2 == 0 and Y % 2 != 0:
            print('First')
        else:
            print('Second')