from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

for _ in range(int(input())):
    N = int(input())
    A = list(map(int, input().split()))
    ans = 1
    for i in range(1, N):
        a = list(str(A[i]))
        while a and a[-1] == "0" and a[0] != "0": a.pop()
        size = len(a)
        a = int("".join(a))
        g = math.gcd(pow(10, size), a)
        x = pow(10, size)//g
        ans = math.lcm(ans, x)
        # print(a, g, x)
    print(ans)