#include<bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int i,n,t,x;
    bool flag;
    cin >> t;
    while(t--)
    {
        cin >> n;
        map<int,bool>mp;
        for(i=0;i<n;i++)
        {
            cin >> x;
            mp[x] ^= 1;
        }
        if(n & 1)
        {
            cout << "Second\n";
            continue;
        }
        flag=1;
        for(auto it : mp)
        {
            if(it.second)
            {
                cout << "First\n";
                flag=0;
                break;
            }
        }
        if(flag)cout << "Second\n";
    }
    return 0;
}

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

using ll = long long;

// エラトステネスのふるい
vector<int> primes;
void sieve(int n) {
  set<int> primes_set;
  for (int i{2}; i <= n; ++i)
    primes_set.insert(i);
  for (int i{2}; i <= n; ++i) {
    if (primes_set.find(i) != primes_set.end()) {
      for (int j{i * 2}; j <= n; j += i) {
        primes_set.erase(j);
      }
    }
  }
  for (const auto &p : primes_set)
    primes.push_back(p);
}

int main() {
  sieve(50);

  int N;
  cin >> N;
  vector<int> X(N);
  for (int i{}; i < N; ++i) cin >> X[i];

  ll ans{numeric_limits<ll>::max()};
  int len = primes.size();
  for (int i{1}; i < (1 << len); ++i) {
    set<int> Y;
    for (int j{}; j < len; ++j) {
      if (i & (1 << j)) {
        Y.insert(primes[j]);
      }
    }
    bool succeed{true};
    for (const auto &x : X) {
      bool coprime{};
      for (const auto &y : Y) {
        if (x % y == 0) {
          coprime = true;
          break;
        }
      }
      if (!coprime) {
        succeed = false;
        break;
      }
    }
    if (succeed) {
      ll mul{1};
      for (const auto &y : Y) {
        mul *= y;
      }
      ans = min(ans, mul);
    }
  }

  cout << ans << endl;
  return 0;
}
