#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int N=200010;
int n,a[N];
long long ans;
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> a[i];
	sort(a+1,a+n+1,[&](const int &x,const int &y){return x>y;});
	deque<int>q;
	for(int i=1;i<=n;i++){
		if(i&1)q.push_front(a[i]);
		else q.push_back(a[i]);
	}
	ans=0;
	int lst=q.back();
	for(auto i:q){
		ans+=1ll*lst*i;
		lst=i;
	}
	cout << ans << '\n';
}
int main(){
	ios::sync_with_stdio(0);
	int T;cin >> T;
	while(T--)solve();
	return 0;
}