/*
把数列中的0提取出来并记录个数,然后对剩下的数排序,将最小的数拿出来作为第二个数,
剩下的数加上所有的0组成第一个数
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 100003;
vector<int> mul(vector<int> a, int b)
{
vector<int> c;
for (int i = 0,t=0; i < a.size()||t; i++)
{
if (i < a.size())
t += a[i] * b;
c.push_back(t % 10);
t /= 10;
}
while (c.size() > 1 && c.back() == 0)
c.pop_back();
return c;
}
vector<int> add(vector<int>a, vector<int> b)
{
if (a.size() < b.size())
return add(b, a);
vector<int> c;
int t = 0;
for (int i = 0; i < a.size(); i++)
{
t += a[i];
if (i < b.size())
t += b[i];
c.push_back(t % 10);
t /= 10;
}
if (t)
c.push_back(t);
return c;
}
int s[N];
int main()
{
int T;
cin >> T;
while (T--)
{
int n;
cin >> n;
int cnt = 0, idx = 0;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
if (x == 0)
cnt++;
else
s[idx++] = x;
}
sort(s, s + idx );
vector<int> a;
for (int i = idx - 1; i > 1; i--)
a.push_back(s[i]);
while (cnt--)
a.push_back(0);
a.push_back(s[1]);
auto res = mul(a, s[0]);
for (int i = res.size() - 1; i >= 0; i--)
cout << res[i];
cout << endl;
}
return 0;
}