#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
using namespace std ;
using ll = long long ;
using ld = long double ;
template<class T> using V = vector<T> ;
template<class T> using VV = V<V<T>> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
ll mod = 1000000007 ;
long double pie = acos(-1) ;
ll INF = 1000000000000 ;

void yorn(bool a){if(a) cout << "Yes" << endl ; else cout << "No" << endl ;}
//void YorN(bool a){if(a) cout << "YES" << endl ; else cout << "NO" << endl ;}
ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
void fix_cout(){cout << fixed << setprecision(20) ;}
template<class T> void chmax(T &a,T &b){if(a<b) a = b ;}
template<class T> void chmin(T &a,T &b){if(a>b) a = b ;}

int main(){
    int n ;
    string s ;
    cin >> n >> s ;
    s = "###"+s+"###" ;
    string t = "fox" ;
    string cur = "###" ;
    if(n<3){
        cout << n << endl ;
        return 0 ;
    }
    set<int> st ;
    for(int i=0;i<s.size();i++) st.insert(i) ;
    int ans = 0 ;
    int p1=-1,p2=-1,p3=-1 ;
    p1 = 3 ;
    p2 = 4 ;
    p3 = 5 ;
    while(p3<n+3){
        cur[0] = s[p1] ;
        cur[1] = s[p2] ;
        cur[2] = s[p3] ;
        if(cur==t){
            ans++ ;
            st.erase(p1) ;
            st.erase(p2) ;
            st.erase(p3) ;
            auto itr = st.lower_bound(p1) ;
            itr-- ;
            p3 = *itr ;
            itr-- ;
            p2 = *itr ;
            itr-- ;
            p1 = *itr ;
        }else{
            auto itr = st.upper_bound(p3) ;
            p3 = *itr ;
            itr-- ;
            p2 = *itr ;
            itr-- ;
            p1 = *itr ;
        }
    }
    cout << n-ans*3 << endl ;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)

int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	int t; cin >> t;
	rep(i,t){
		int n; cin >> n;
		map<int,int> mp;
		rep(i,n){
			int a; cin >> a;
			mp[a] ^= 1;
		}
		bool even = true;
		for(auto [a,v]: mp) if(v) even = false;
		puts(n&1 || even ? "Second" : "First");
	}
}