#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
int N;
ll A[202020];
ll p[11][20];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	for(i=1;i<=10;i++) {
		p[i][0]=1;
		FOR(x,19) p[i][x+1]=p[i][x]*i;
	}
	
	cin>>T;
	while(T--) {
		cin>>N;
		ll ma=1;
		int ma2=0,ma5=0;
		FOR(i,N) {
			cin>>A[i];
		}
		for(i=N-1;i>=0;i--) {
			if(A[i]==0) continue;
			ll ret=1;
			FOR(j,ma2) ret*=2;
			FOR(j,ma5) ret*=5;
			ma=max(ma,ret);
			
			int mi2=100,mi5=100;
			int l=to_string(A[i]).size();
			ll v=p[10][l];
			FOR(x,10) FOR(y,10) {
				ll a=A[i]*p[2][x]*p[5][y];
				if(a%v==0) mi2=min(mi2,x),mi5=min(mi5,y);
			}
			ma2=max(ma2,mi2);
			ma5=max(ma5,mi5);
			
		}
		cout<<ma<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}