#include<bits/stdc++.h>
using namespace std;
int n,a[1001],t[1001];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		t[a[i]]++;
	}
	for(int i=1;i<=n;i++){
		if(t[i]!=1){
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int INF=1<<30;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main(){
	int t;cin>>t;
	for(int i = 0; i < t; i++) {
		int n;cin>>n;
		map<ll,ll> dict;
		for(int i = 0; i < n; i++) {
			ll tmp;cin>>tmp;
			dict[tmp]++;
		}
		if(n % 2 == 1){
			cout << "Second" << endl;
			continue;
		}
		else{
			bool flag = true;
			for(auto e:dict) {
				if(e.sc % 2 == 1){
					cout << "First" << endl;
					flag = false;
					break;
				}
			}
			if(flag)cout << "Second" << endl;
		}
	}
	return 0;
}