#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <set>

#include <map>

#include <queue>

#include <vector>

#include <string>

#define LL long long

using namespace std;

const LL maxN = 1e9;

int n;

int t[], a[], len;

LL ans;

void input()

{

    scanf("%d", &n);

    len = n;

    for (int i = ; i < len; ++i)

        scanf("%d", &t[i]);

    for (int i = ; i < len; ++i)

    {

        if (t[i] == -) continue;

        for (int j = ; j < len; ++j)

        {

            if (i == j) continue;

            if (t[j] == -) continue;

            if (t[j]%t[i] == ) t[j] = -;

        }

    }

    int top = ;

    for (int i = ; i < len; ++i)

        if (t[i] != -)

            a[top++] = t[i];

    len = top;

    sort(a, a+len);

}

LL gcd(LL x, LL y)

{

    LL r;

    while (y != )

    {

        r = y;

        y = x%y;

        x = r;

    }

    return x;

}

LL lcm(LL x, LL y)

{

    return x/gcd(x, y)*y;

}

void dfs(int now, LL num, int sz)

{

    if (now == len)

    {

        if (sz)

        {

            LL last = maxN/num;

            if (sz&) ans -= last;

            else ans += last;

        }

        return;

    }

    if (num%a[now] == ) return;

    dfs(now+, num, sz);

    LL t = lcm(num, a[now]);

    if (t <= maxN) dfs(now+, t, sz+);

}

void work()

{

    if (len ==  && a[] == ) printf("0\n");

    else

    {

        ans = maxN;

        dfs(, , );

        cout << ans << endl;

    }

}

int main()

{

    //freopen("test.in", "r", stdin);

    int T;

    scanf("%d", &T);

    for (int times = ; times <= T; ++times)

    {

        input();

        work();

    }

    return ;

}