//算n个数的最小公倍数

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 int gcd(int a, int b)

 {

     return b==?a:gcd(b,a%b);

 }

 int lcm(int a, int b)

 {

     return a/gcd(a,b)*b;

 }

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

         int n;

         scanf("%d",&n);

         int tm = ;

         int a;

         for(int i = ; i < n; i++){

             scanf("%d",&a);

             tm = lcm(tm,a);

         }

         printf("%d\n",tm);

     }

     return ;

 }