#include <bits/stdc++.h>
#define fi first
#define se second

//#define ivorysi
#define enter putchar('\n')
#define space putchar(' ')
#define pii pair<int,int>
#define MOD 998244353
#define MAXN 100005
typedef long long int64;
using namespace std;

template<class T>
void read(T &res) {
	res = 0;T f = 1;char c = getchar();
	while(c < '0' || c > '9') {
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9') {
		res = res * 10 + c - '0';
		c = getchar();
	}
	res *= f;
}
template<class T>
void out(T x) {
	if(x < 0) {x = -x;putchar('-');}
	if(x >= 10) out(x / 10);
	putchar('0' + x % 10);
}

int T,N,a[MAXN];
string nm[2] = {"First","Second"};
void Solve() {
	read(N);
	for(int i = 1 ; i <= N ; ++i) {
		read(a[i]);
	}
	sort(a + 1,a + N + 1);
	int t = 0;t ^= (N & 1);
	if(N % 2 == 0) {
		bool f = 1;
		for(int i = N ; i >= 1 ; i -= 2) {
			if(a[i] != a[i - 1]) {f = 0;break;}
		}
		t ^= f;
	}
	cout << nm[t] << endl;
}
int main() {
#ifdef ivorysi
	freopen("f1.in","r",stdin);
#endif
	read(T);
	while(T--) {
		Solve();
	}
	return 0;
}

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

void solve(){
    ll n;
    cin>>n;
    vector<ll>v;
    for(ll i=2; i*i<=n; i++){
      for(int j=2; j<=50;j++){
        ll x = pow(i,j);
        if(x>n){
          break;
        }
        else{
          v.push_back(pow(i,j));
        }
      }
    }
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    cout<<n-v.size()<<endl;
    return;
}



int main(){
  #ifndef ONLINE_JUDGE
  freopen("/home/shubham/Desktop/codes/input.txt", "r", stdin);
  freopen("/home/shubham/Desktop/codes/output.txt", "w", stdout);
  #endif
  ll t;
  // cin>>t;
  t = 1;
  while(t--){
    solve();
  }
  return 0;
} 