//7000.rpm
#include <bits/stdc++.h>
using namespace std;
#define int long long int
void solve() {
int n;
cin>>n;
vector<int>vec(n);
for(int i=0;i<n;i++){
cin>>vec[i];
}
sort(vec.begin(),vec.end());
int multi(1);
for(int i=0;i<n;i++){
if(i==0){
continue;
}
else{
multi*=vec[i];
}
}
int mn = vec[0];
++mn;
cout<<mn*multi<<endl;
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int tt;
cin >> tt;
for(int i=0;i<tt;i++){
solve();
}
return 0;
}
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |