//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define eps 1e-9
#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int>pii;
const ll mod = 1e9+7;
long double PI = acosl(-1);
const ll infl = 1e18;
//const int inf = 2e9;
const int nmax = 1e6+5;
const int MAXLG = log2(nmax)+1;
//mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//typedef tree< int, null_type, greater_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ost;

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int tc;
    cin>>tc;
    while(tc--){
        int n;
        cin>>n;
        vector<int>v(n);
        for(int &x : v) cin>>x;
        if(n%2) cout<<"Second\n";
        else{
            map<int, int>cnt;
            for(int x : v) cnt[x]++;
            bool mara = false;
            for(auto z : cnt){
                if(z.second%2) mara=true;
            }
            if(mara) cout<<"First\n";
            else cout<<"Second\n";
        }
    }
}
/*
*/

#include <bits/stdc++.h>
#include <fstream>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;


int main(){

    ll n;
    cin >> n;
    vector<pair<string,int>> s(n);
    for(int i=0;i<n;i++){
        string tmp;
        cin >> tmp;
        if(tmp[0] == '!'){
            s[i] = {tmp,1};
        }
        else{
            tmp.insert(0,"!");
            s[i] = {tmp,0};
        }
    }
    sort(s.begin(),s.end());
    string ans;
    for(int i=0;i<n-1;i++){
        if(s[i].first==s[i+1].first&&s[i].second!=s[i+1].second){
            s[i].first.erase(s[i].first.begin());
            ans = s[i].first;
            cout << ans << endl;
            return 0;
        }
    }
    cout << "satisfiable " << endl;
    return 0;
}