#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int tc;
	cin >> tc;
	while(tc--){
		int n;
		cin >> n;
		vector<long long> a(n);
		for(int i=0;i<n;i++) cin >> a[i];
		
		if(n&1){
			cout << "Second\n";
		}else{
			sort(a.begin(),a.end());
			
			bool bo=true;
			for(int i=0;i<n;i+=2){
				if(a[i]!=a[i+1]) bo=false;
			}
			
			if(bo){
				cout << "Second\n";
			}else{
				cout << "First\n";
			}
		}
	}
	return 0;
}
#include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x,i) ((x)|(1ll<<(i)))
#define FLIP(x,i) ((x)^(1ll<<(i)))
#define CLEAR(x,i) ((x)&~(1ll<<(i)))
const double pi = 4 * atan(1);
using namespace std;
typedef long long ll;

template<class ForwardIterator> void print_vec(ForwardIterator first, ForwardIterator last, string sep = " ", string end="\n") {
	bool ft = true;
	while (first != last) {
		if (! ft) {cout << sep;} else {ft = false;}
		cout << (*first);
		++first;
	}
	cout << end;
}

inline ll floorDiv(ll x, ll y) {
	ll d = x / y;
	ll r = x % y;
	return r ? (d - ((x < 0) ^ (y < 0))) : d;
}

ll ceilDiv(ll x, ll y) {
	return -floorDiv(-x, y);
}

bool predicate(ll mid) {
	return mid > 10;
}

ll bin_search(ll lo, ll hi) {
	int sign = lo < hi ? 1 : -1;
	lo *= sign;
	hi *= sign;
	hi++;
	while (lo < hi) {
		ll mid = floorDiv(lo + hi, 2);
		if (!predicate(sign * mid)) {
			lo = mid + 1;
		} else {
			hi = mid;
		}
	}
	return sign * lo;
}
const ll MOD = 1000000007;
const int MAXN = 200005;

ll num[MAXN];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	TC {
		int n;
		cin >> n;
		FOR(i,0,n){
			cin >> num[i];
		}
		if (n%2 == 1) {
			cout << "Second\n";
			continue;
		}
		map<ll,int> cnt;
		FOR(i,0,n) {
			cnt[num[i]]++;
		}
		bool g = true;
		for (auto &p : cnt) {
			if (p.S%2!=0) {
				g=false;
				break;
			}
		}
		cout << (g ? "Second\n" : "First\n" );
	}

}
