RT

#include<bits/stdc++.h>
#define Std_Maker lhm
#define ll long long
using namespace std;
const int N=1e6+1;
int n,q,x;
bool ok;
array<int,N> a;
set<int> ans,lst,now,ins;
int gcd(int a,int b)
{
    if(!b) return a;
    else return gcd(b,a%b);
}
int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>q;
    while(q--)
    {
        cin>>n;
        ok=0;
        ins.clear(),ans.clear(),lst.clear(),now.clear();
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            ans.insert(a[i]);
        }
        for(int i=n;i>=1;i--)
        {
            now.insert(a[i]);
            for(auto j:lst)
            {
                now.insert(lcm(j,a[i]));
                ans.insert(lcm(j,a[i]));
            }
            swap(now,lst);
        }
        for(int i=1;i<=ans.size();i++) ins.insert(i);
        for(auto i:ins)
        {
            if(ans.find(i)==ans.end())
            {
                cout<<i<<endl;
                ok=1;
                break;
            }
        }
        if(ok==0) cout<<ans.size()+1<<endl;
    }
    return 0;
}