#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i,a,n) for (int i=a;i<n;i++)
const int  MOD = 1e9+7;


void solve() {
	int n; cin >> n;
	vector<int> v(n);
	rep(i,0,n) {
		cin >> v[i];
	}
	sort(v.begin(),v.end());
	if(n%2==1) {
		cout << "Second" << endl;
	}
	else {
		bool b = true;
		for(int i = 0; i <n; i+=2) {
			if (v[i] != v[i+1]) {
				b = false;
				break;
			}
		}
		(b) ? cout << "Second"<<endl: cout << "First"<<endl;
	}









}

int main() {
	std:ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int t; cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#define itn int
#define sacnf scanf
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int N = 3e5 + 1;


int main()
{
	int n;
	scanf("%d", &n);
	vector<int> v(n + 1);
	for (int i = 0; i < n; i++)
	{
		int a;
		scanf("%d", &a);
		v[a]++;
	}
	for (int i = 1; i <= n; i++)
	{
		if (v[i] != 1) return printf("No"), 0;
	}
	printf("Yes");
	return 0;
}