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

int main() {
  	cin.tie(0);
    ios::sync_with_stdio(false);
  
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
      	vector<long> a(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        if (n & 1) cout << "Second";
        else {
            sort(a.begin(),a.end());
            long count = 0ll;
            for (int i = 0; i < n; i += 2) count += a[i] - a[i + 1];
            if (count == 0) cout << "Second";
            else cout << "First";
        }
        cout << '\n';
    }
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll,ll>
using Graph = vector<vector<int>>;

ll mod = 1000000007;

int main() {
    ll T; cin >> T;
    rep(i,T){
        ll N; cin >> N;
        vector<ll> a; ll sum = 0;
        a.clear();
        rep(i,N){
            ll b; cin >> b;
            a.push_back(b); sum += b;
        }
        if(N%2==1) cout << "Second" << endl;
        else{
            sort(a.begin(),a.end());
            ll subsum = 0;
            rep(i,N/2){
                subsum += a[i*2];
            }
            if(subsum*2==sum) cout << "Second" << endl;
            else cout << "First" << endl;
        }
    }
}