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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int q;
    cin >> q;
    while (q-- ) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0;i < n;++i) cin >> a[i];
        bool fi = false;
        if (n%2 == 0) {
            sort(a.begin(),a.end());
            for (int i = 0;i < n/2;++i) if (a[i*2] != a[i*2+1]) {
                fi = true;
                break;
            }
        }
        cout << (fi ? "First" : "Second") << newl;
    }
}
// 解き直し.
// https://atcoder.jp/contests/arc105/editorial/171
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define a first
#define b second

int main(){
    
    // 1. 入力情報.
    int T;
    scanf("%d", &T);
    
    // 2. 各テストケースを確認.
    rep(i, T){
        // 2-1. テストパターン.
        int N;
        scanf("%d", &N);
        LL a;
        map<LL, int> m;
        rep(j, N){
            scanf("%lld", &a);
            m[a]++;
        }
        
        // 2-2. N が 奇数.
        if(N & 1) puts("Second");
        
        // 2-3. N が 偶数.
        if(!(N & 1)){
            // 任意の整数 n について n 個のコインが入った袋の偶奇をチェック.
            LL e = 0;
            for(auto &p : m) if(!(p.b & 1)) e++;
            
            // 任意の整数 n について n 個のコインが入った袋が偶数個ある場合(後手必勝).
            if(m.size() == e) puts("Second");
            
            // それ以外.
            if(m.size() != e) puts("First");
        }
    }
    return 0;
    
}