import sys

def solve():
    input = sys.stdin.read
    data = input().split()
    if not data:
        return
    
    T = int(data[0])
    idx = 1
    
    out = []
    for _ in range(T):
        N = int(data[idx])
        A = [int(x) for x in data[idx+1 : idx+1+N]]
        idx += 1 + N
        
        xor_sum = 0
        for x in A:
            k = (x & -x).bit_length() - 1
            xor_sum ^= k
            
        if xor_sum != 0:
            out.append("First")
        else:
            out.append("Second")
            
    print('\n'.join(out))

if __name__ == '__main__':
    solve()