//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define mod 998244353
#define Ma 1000005
#define G 3
#define pb push_back
#define L (1<<21)
#define all(x) x.begin(),x.end()
using namespace std;

ll n,m;


vector <ll> l,r;

bool cmp(ll x,ll y)
{
	return x>y;
}

void sol()
{
    l.clear(),r.clear();
   cin>>n;
   ll cnt=0;
   for (ll i=1;i<=n;i++)
   {
        ll x;
        cin>>x;
        if (x>0)
            l.pb(x);
        else if (x<0)
            r.pb(x);
        else
            cnt++;
   }

   sort(all(l),cmp),sort(all(r),cmp);
   ll ans=0;
   for (ll i=1;i<l.size();i++)
		ans+=l[max(0ll,i-2)]*l[i];
	for (ll i=1;i<r.size();i++)
        ans+=r[max(0ll,i-2)]*r[i];
    if (!l.size()||!r.size())
    {
    	if (!l.size())
    	{
    		if (!cnt)
    		ans+=r.back()*r[r.size()-2];
		}
    		
    	else if (!r.size())
    	{
    		if (!cnt)
    			ans+=l.back()*l[l.size()-2];
		}
        printf("%lld\n",ans);
        return;
    }
    else if (cnt==0)
    {
        ans+=l.back()*r[0]+r.back()*l[0];
        printf("%lld\n",ans);
    }
    else if (cnt==1)
    {
        ans+=l.back()*r.back();
        printf("%lld\n",ans);
    }
    else
    {
    	printf("%lld\n",ans);
	}
    return;
}

int	main(){
    ios::sync_with_stdio(0); cin.tie(0);
    ll tt=1;
    cin>>tt;
   while (tt--)
        sol();
    return 0;
}
/*500000 500000*/