// g++ -Wall -std=gnu++20 -march=native -O2 -static -DAWASHAMITYOAK
#ifdef AWASHAMITYOAK
#include <procon_local.h>
#else
#include <bits/stdc++.h>
#include <atcoder/all>
#endif
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;
istream& operator>> (istream& is, mint& x) { long long _x; is >> _x; x = _x; return is; }
ostream& operator<< (ostream& os, const mint& x) { return os << x.val(); }
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& x) { return os << "{" << x.first << ", " << x.second << "}"; }
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP2(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define REP1(i, n) REP2(i, 0, n)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define RREP2(i, r, l) for (int i = (int)(r)-1; i >= (int)(l); --i)
#define RREP1(i, n) RREP2(i, n, 0)
#define rrep(...) OVERLOAD_REP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#define mp make_pair
#define mt make_tuple
const ll INF = 4e18;
const ll MOD = 998244353;
const ll MOD1 = 1e9 + 7;
template<class T> inline bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> T pow(T a, T b, T m) { return b ? b&1 ? a*pow(a, b^1, m)%m : pow(a*a%m, b>>1, m)%m : 1; }
template<class T> T pow(T a, T b) { return b ? b&1 ? pow(a, b^1)*a : pow(a*a, b>>1) : 1; }
template<class... T> inline void input(T&... a) { ((cin >> a), ...); }
template<class T, class... U> inline void print(const T& a, const U&... b) { cout << a; ((cout << " " << b), ...); }
template<class T, class... U> inline void println(const T& a, const U&... b) { print(a, b...); cout << endl; }
inline void println() { cout << endl; }
template<class T> inline void print(vector<T>& A) { rep(i, A.size()) if (i) print("", A[i]); else print(A[i]); }
template<class T> inline void println(vector<T>& A) { print(A); cout << endl; }
const int di[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[8] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int ll
void solve() {
    int N;
    input(N);
    vector<int> A(N);
    rep(i, N) input(A[i]);
	
	auto fn = [](int A) -> pair<int, int> {
    	int t = 0, f = 0;
	    string S = to_string(A);
    	while (A != 0) {
    	    while (S.back() == '0') S.pop_back();
    	    
        	int k = 1;
        	rep(i, S.size()) k *= 10;
        	
        	A = stoll(S);
        	
        	if (A % 2 == 0) {
        		f++;
        		A *= 5;
        		A %= k;
        	} else {
        		t++;
        		A *= 2;
        		A %= k;
        	}
        	int p = S.size();
        	S = to_string(A);
        	S = string(p - S.size(), '0') + S;
    	}
    	return {t, f};
	};
    
    int two = 0;
    int five = 0;
    rep(i, 1, N) {
    	auto [t, f] = fn(A[i]);
    	
    	chmax(two, t);
    	chmax(five, f);
    }
    int ans = 1;
    rep(i, two) ans *= 2;
    rep(i, five) ans *= 5;
    println(ans);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T;
    input(T);
    rep(t, T) solve();
}