#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
using namespace std;
const int N=1e5+100;
int T,n,a[N],b[N],w,t[N];
signed main()
{
	scanf("%d",&T);
	while (T--)
	{
		scanf("%d",&n);
		for (int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];
		if (n==1)
		{
			printf("Second\n");
			continue;
		}
		sort(b+1,b+1+n);
		w=unique(b+1,b+1+n)-b-1;
		for (int i=1;i<=n;i++) a[i]=lower_bound(b+1,b+1+w,a[i])-b;
		for (int i=1;i<=n;i++) t[i]=0;
		for (int i=1;i<=n;i++) t[a[i]]++;
		int cnt=0;
		for (int i=1;i<=n;i++) cnt+=(t[i]&1);
		if (n%2==0)
		{
			if (!cnt) printf("Second\n");
			else printf("First\n");
		}
		else
		{
			if (cnt==1) printf("First\n");
			else printf("Second\n");
		}
	}
}
#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
 
#define F first
#define S second
 
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
 
void add(int &x, int y){
	x += y;
	while (x >= MOD) x -= MOD;
	while (x < 0) x += MOD;
}
 
int fix(int x){
	while (x >= MOD) x -= MOD;
	while (x < 0) x += MOD;
	return x;
}
 
int pw(int a, int b){
	int ret = 1;
	while (b){
		if (b & 1)
			ret = 1ll*ret*a%MOD;
		b >>= 1;
		a = 1ll*a*a%MOD;
	}
	return ret;
}
 
const int MAXN = 1e6 + 10;

int n, a[MAXN];
set<int> st;

vector<int> factor(int X) {
	vector<int> vec;
	for(int i = 1; i*i <= X; i++) {
		if(X % i == 0) {
			for(int x : {i, X/i}) 
				if(x <= a[0])
					vec.push_back(x);
		}
	}
	return vec;
}

bool check(int x) {
	int cur = -1;
	for(int j = 0; j < n; j++) {
		if(a[j] % x == 0) {
			if(~cur) {
				cur = __gcd(cur, a[j]);
			} else cur = a[j];
		}
	}
	return cur == x;
}

void solve() {
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a+n);
	vector<int> vec;
	for(int i = 0; i < n; i++) {
		vector<int> sec = factor(a[i]);
		for(int x : sec)
			vec.push_back(x);
	}
	sort(vec.begin(), vec.end());
	vec.resize(unique(vec.begin(), vec.end())-vec.begin());
	int ans = 0;
	for(int x : vec) if(check(x)) ++ans;
	cout << ans << endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//cout << fixed << setprecision(6);
	
	int te = 1;	
	//cin >> te;
	for (int w = 1; w <= te; w++){
		//cout << "Case #" << w << ": ";
		solve();
	}
	return 0;
}
