#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using i128 = __int128;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;

constexpr ll INF = (1LL << 60);
ll ALPHABET_N = 26;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define rrep(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define all(a) a.begin(), a.end()

template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t;
    cin >> t;
    vector<ll> tens(20);
    tens[0] = 1;
    tens[1] = 10;
    rep_(i, 2, 20) tens[i] = tens[i - 1] * 10;
    rep(_, t)
    {
        ll n;
        cin >> n;
        vector<ll> A(n);
        rep(i, n) cin >> A[i];
        ll ans = 1;
        rep_(i, 1, n) {
            ll a= A[i];
            ll m = 1;
            string s = to_string(a);
            rep(_, s.size()) m *= 10;
            ans = lcm(ans, m / gcd(a, m));
        }
        cout<<ans<<endl;
    }
    return 0;
}