#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e5+5;
int a[N],T,n;
map<int,int>mp;
void solve(){
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",a+i);
	rep(i,1,n) mp[a[i]]++;
	bool flag=1;
	rep(i,1,n) if(mp[a[i]]&1){
		flag=0; break;
	}
	if(n%2==0) puts(flag?"Second":"First");
	else puts(flag?"First":"Second");
	mp.clear();
}
int main(){
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}

//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll num[524310];
bool kazu[524310];
const int ma = (1 << 19) - 1;
int k;
void add(ll n) {
	int n2 = (n & ma) + 1;
	while (num[n2]) {
		if (num[n2] == n + 1) {
			kazu[n2] = !kazu[n2];
			k += (kazu[n2] * 2) - 1;
			return;
		}
		n2 = n2 * 2 % 524309;
	}
	num[n2] = n + 1;
	kazu[n2] = 1;
	k++;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int T;
	cin >> T;

	rep(t, T) {
		int N;
		cin >> N;

		if (N % 2) {
			rep(i, N) {
				int a;
				cin >> a;
			}
			co("Second");
		}
		else {
			int tmp = k;
			rep(i, N) {
				int a;
				cin >> a;
				add(a + 1000000000ll * t);
			}
			if (tmp == k) co("Second");
			else co("First");
		}
	}

	Would you please return 0;
}