3002

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef __int64 LL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)

#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}


// code begin
const LL mx=1000000000;
int T;
LL N,a,b;
LL gcd(LL aa,LL bb)
{
	if(bb==0) return aa;
	return gcd(bb,aa%bb);
}
int main()
{
	read;
	write;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%I64d",&N);
		scanf("%I64d",&a);
		int i;
		for(i=1;i<N;i++)
		{
			scanf("%I64d",&b);
			b = (a*b)/gcd(a,b);
			if(b>mx)
			{
				printf("More than a billion.\n");
				break;
			}
			a = b;
		}
		if(i<N)
			for(i++;i<N;i++)
				scanf("%I64d",&b);
		else
			printf("%I64d\n",b);
	}
	return 0;
}
posted @ 2011-05-01 00:38  AC2012  阅读(146)  评论(0编辑  收藏  举报