#include "bits/stdc++.h"
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define maxn 100000
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef double db;


int main()
{
    int cas; scanf("%d",&cas); while(cas--)
    {
        int n; scanf("%d",&n); vi a(n+1,0);
        rep(i,1,n) scanf("%d",&a[i]);
        if(n&1) puts("Second");
        else
        {
            map<int,int> cnt;
            rep(i,1,n) cnt[a[i]]++;
            bool ok=1;
            for(auto it: cnt) if(it.SE&1) ok=0;
            puts(ok?"Second":"First");
        }
    }
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii; 
#define ll long long
#define ar array
const ll mxN=2e5;
const int mod=1e9+7;
const ll INF=1e18;
#define what_is(x) cerr << #x << " is " << x << endl;
ll a,b,n,k,m,x,y,h,l,r,t;

void solve(){
	cin>>n;
	string s[n];
	map<string,int> mp;
	for(int i=0;i<n;i++){
		cin>>s[i];
		string s2;
		mp[s[i]]=1;
	}

	for(int i=0;i<n;i++){
		if(s[i][0]!='!'){
			string check='!'+s[i];
			if(mp[check]){
				cout<<s[i]<<endl;
				return;
			}
		}
	}
	cout<<"satisfiable"<<endl;
}	


signed main() {
	#ifndef ONLINE_JUDGE
        freopen("input.txt","r",stdin);
        // freopen("output.txt","w",stdout);
    #endif
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    cout<<setprecision(12)<<fixed;
    // cin>>t;
    // while(t--)
    	solve();
	return 0;
   
}
 