#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int a[100000];
int main() {
    int i;
    int T,N;
    scanf("%d",&T);
    while (T--) {
        scanf("%d",&N);
        for (i = 0; i < N; i++) scanf("%d",&a[i]);
        sort(a,a+N);

        if (!(N & 1)) {
            for (i = 0; i < N; i += 2) {
                if (a[i] != a[i+1]) break;
            }
            if (i >= N) printf("Second\n");
            else printf("First\n");
        }
        else printf((N & 1) ? "Second\n":"First\n");
    }

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, b) for(int i = a; i <= b; ++i)
const int N = 300007;
const int mod = 1e9 + 7;
int n;
int a[N];
int main()
{
	int T;
	cin >> T;
	while(T--){
		cin >> n;
		int key = 0;
		rep(i, 1, n)cin >> a[i], key ^= a[i];
		if(n & 1){
			puts("Second");
		}
		else {
			map<int, int>mp;
			rep(i, 1, n){
				if(mp.count(a[i]))mp[a[i]]++;
				else mp[a[i]] = 1;
			}
			int flag = 0;
			for(auto v : mp)if(v.second % 2 == 1)flag = 1;
			if(flag)puts("First");
			else puts("Second");
		}
	}
}