#include <stdio.h>

int solve(int N, int A[])
{
	int i, flag = 0;
	long long sum = 0;
	for (i = 1; i <= N; i++) {
		if (A[i] == 1) flag = 1;
		sum += A[i] - 1;
	}
	if (flag != 0) return sum % 2;
	if (sum % 2 != 0 || N % 2 == 0) return 1;
	else return 0;
}

int main()
{
	int i, t, T, N, A[200001];
	scanf("%d", &T);
	for (t = 1; t <= T; t++) {
		scanf("%d", &N);
		for (i = 1; i <= N; i++) scanf("%d", &(A[i]));
		if (solve(N, A) == 0) printf("Second\n");
		else printf("First\n");
	}
	fflush(stdout);
	return 0;
}