#include<bits/stdc++.h> using namespace std; long long _,n,a[100005]; map<long long ,long long>bs; int main(){ scanf("%lld",&_); while(_--){ bs.clear(); scanf("%lld",&n); for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); } for(int j=1;j<=n;j++){ long long now=a[j]; long long tp=0; bs[a[j]]=1; for(int i=j+1;i<=n;i++){ long long cg=now*a[i]/__gcd(now,a[i]); if(now!=cg){ bs[cg]=1; } now=cg; if(now>1300000 || 1!=j && (now%a[j-1])==0)break; } } for(int i=1;;i++){ if(bs[i]==0){ printf("%d\n",i); break; } } } }