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

int i,j,k,m,t,n,a[10],b[10],p10[10]={1,10,100,1000,10000,100000,1000000,10000000};
double p,res,r[15];
string sb;

void chk(int x,int y){
	int tmp1=0,tmp2=0,i,j,k,c[15]={0},d[15]={0};
	for(i=1;i<=5;i++){
		c[a[i]]++;
		d[b[i]]++;
	}
	for(i=1;i<=9;i++){
		tmp1+=i*p10[c[i]];
		tmp2+=i*p10[d[i]];
	}
	//printf("%d %d %d %d\n",x,y,tmp1,tmp2);
	if(tmp1>tmp2){
		if(x==y){
			res+=r[x]*(r[x]-1)/2;
		}
		else{
			res+=r[x]*r[y]/2;
		}
	}
}

int main(){
	cin>>n;
	for(i=1;i<=9;i++){
		r[i]=n;
	}
	p=n;p=(p*9-8)*(p*9-9)/2;
	cin>>sb;
	for(i=0;i<4;i++){
		a[i+1]=sb[i]-'0';
		r[a[i+1]]--;
	}
	cin>>sb;
	for(i=0;i<4;i++){
		b[i+1]=sb[i]-'0';
		r[b[i+1]]--;
	}
	for(i=1;i<=9;i++){
		for(j=1;j<=9;j++){
			a[5]=i;
			b[5]=j;
			chk(i,j);
		}
	}
	printf("%.20lf",res/p);
}
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author tatsumack
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>

#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)

using namespace std;

class DLetsPlayNim {
public:
    void solve(std::istream& cin, std::ostream& cout) {
        int T;
        cin >> T;
        while (T--) {
            int N;
            cin >> N;
            vector<int> a(N);
            REP(i, N) cin >> a[i];
            int res = 0;
            REP(i, N) res ^= a[i];
            if (res != 0) {
                if (N % 2 == 0) {
                    cout << "First" << endl;
                } else {
                    cout << "Second" << endl;
                }
            } else {
                map<int, int> cnt;
                for (auto n : a) {
                    cnt[n]++;
                }
                bool ok = true;
                for (auto kv : cnt) {
                    if (kv.second % 2 == 1) {
                        ok = false;
                        break;
                    }
                }
                if (ok) {
                    cout << "Second" << endl;
                    continue;
                }
                if (N % 2 == 0) {
                    cout << "First" << endl;
                } else {
                    cout << "Second" << endl;
                }
            }
        }
    }
};


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    std::istream& in(std::cin);
    std::ostream& out(std::cout);

    DLetsPlayNim solver;
    solver.solve(in, out);
    return 0;
}
