#include <cstdio>
#include <queue>
#include <set>
#define ll long long
#define mp make_pair
using namespace std;
const int maxn = 3e5 + 5;
int T, n;
int x[maxn];
set <ll> now[maxn];
priority_queue < pair<ll, int> > q;
ll gcd (ll a, ll b)
{
    if (!b) return a;
    return gcd(b, a % b);
}
ll lcm (ll a, ll b){ return a * b / gcd(a, b); }
int main ()
{
    scanf("%d", &T);
while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)    scanf("%d", &x[i]), q.push(mp(-x[i], i)), now[i].clear(), now[i].insert(x[i]);
    ll ans = 1;
    while (!q.empty() && q.top().first == -ans) {
        while (!q.empty() && q.top().first == -ans) {
            ll l = -q.top().first;
            int i = q.top().second;
            q.pop();
            if (++i <= n) {
                l = lcm(l, x[i]);
                if (now[i].find(l) == now[i].end()) q.push(mp(-l, i)), now[i].insert(l);
            }
        }
        ++ans;
    }
    while (!q.empty())	q.pop();
    printf("%lld\n", ans);
}
    return 0;
}