#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1000000007;

void solve() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    if(n % 2) {
        cout << "Second\n";
        return;
    }
    map<ll,ll> mp;
    rep(i, 0, n) mp[a[i]]++;
    bool f = true;
    for(auto e: mp) {
        if(e.second % 2) f = false;
    }
    if(f) cout << "Second\n";
    else cout << "First\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll t;
    cin >> t;
    while(t--) solve();
    return 0;
}
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;

int main() {
	int n;
	cin >> n;
	int i;
	int num;
	int count = 0;
	int check = 0;
	for (i = 1; i <= n; i++) {
		num = i;
		while (num/10>0||num%10!=0) {
			if (num%10==7) {
				check = 1;
				break;
			}
			num = num / 10;
		}
		num = i;
		while (num / 8 > 0 || num % 8 != 0) {
			if (num % 8 == 7) {
				check = 1;
				break;
			}
			num = num / 8;
		}
		if (check == 0) {
			count++;
		}
		check = 0;
	}
	cout << count;
	return 0;
}