// Least common multiple

#include <cstdio>

long long lcm( long long a, long long b )
{
    long long r, mul;
    
    r = a % b;
    mul = a * b;
    while ( r )
    {
        a = b;
        b = r;
        r = a % b;
    }
    
    return mul / b;   
}

int main()
{
    int i, t, n;
    long long ans, num;
    
    scanf("%d",&t);
    while ( t-- )
    {
        scanf("%d", &n);
        ans = 1;
	while ( n-- )
	{
            scanf("%lld", &num);
	    ans = lcm( ans, num );
            if ( ans > 1e9 ) break;
        }
        if ( n == -1 ) 
        	printf("%lld\n",ans);
        else 
		printf("More than a billion.\n");
    }
    
    return 0;
}