#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

int main()
{
    fast_io
    string s,p;
    cin>>s;
    p.push_back(' ');
    ll n = s.length();
    
    for(ll i=0; i<n;i++)
    p.push_back(s[i]);
    
    ll flag=0;
    
    for(ll i=1;i<=n;i++)
    {
        if(i%2!=0)
        {
            if(isupper(p[i]))
            flag =1;
        }
        else
        {
            if(islower(p[i]))
            flag=1;
        }
        
    }
    
    if(flag ==1)
    cout<<"No\n";
    else
    cout<<"Yes\n";
    
}
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<char> vc;
typedef vector<vc> vvc;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge{ll to, cost;};

template <typename T>
bool chmax(T &a, const T &b) {
    if (a < b) {
      a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a, const T &b) {
    if (a > b) {
      a = b;
      return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while(T--){
        int N;
        cin >> N;
        vl A(N);
        rep(i,N){
            cin >> A[i];
        }
        sort(A.begin(),A.end());
        if(N%2==1){
            cout << "Second" << endl;
        }
        else{
            bool ok=true;
            rep(i,N/2){
                if(A[2*i]!=A[2*i+1]){
                    ok=false;
                }
            }
            cout << (ok ? "Second" : "First") << endl;
        }
    }
}