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


int32_t main(){

    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    int t;
    cin>>t;

    while(t--){
        int n;
        cin>>n;

        map<int,int> mp;
        for(int i=0;i<n;i++){
            int x;
            cin>>x;
            mp[x]++;
        }

        if(n&1){
            cout<<"Second"<<"\n";
            continue;
        }

        bool all_even = true;
        for(pair<const int,int> &p : mp){
            if(p.second&1){
                all_even = false;
                break;
            }
        }

        if(all_even){
            cout<<"Second"<<"\n";
        }
        else {
            cout<<"First"<<"\n";
        }
    }
    

    return 0;
}
#include <bits/stdc++.h>
#define For(i, l, r) for (register int i = l, _r = r; i <= _r; ++i)
#define Ford(i, l, r) for (register int i = r, _l = l; i >= _l; --i)
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mk make_pair
const int N = 1e5 + 20;
const int mod = 1e9 + 7;
int T, n, a[N];
ll sum, tot;

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 3) + (x << 1) + ch - '0';
        ch = getchar();
    }
    return x * f;
}

int main()
{
    int t = read();
    while (t--)
    {
        sum = tot = 0;
        n = read();
        For(i, 1, n)
            a[i] = read();
        sort(a + 1, a + 1 + n);
        if (n & 1)
        {
            For(i, 2, n) i & 1 ? sum += a[i] : tot += a[i];
            sum += a[1];
            puts(sum ^ tot ? "Second" : "First");
        }
        else
        {
            For(i, 1, n) i & 1 ? sum += a[i] : tot += a[i];
            puts(sum ^ tot ? "First" : "Second");
        }
    }
    return 0;
}
