#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a[64];
ll mnus[64];
ll uminus[64];
int t;
int n;
bool cmp(ll a,ll b)
{
    return (abs(a)>abs(b));
}
int main()
{
    cin>>t;
    for(int j=1;j<=t;j++)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
        cin>>a[i];
        memset(mnus,0,sizeof(mnus));
        memset(uminus,0,sizeof(uminus));
        
        int im=0,iu=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i]>0)
            {
                iu++;
                uminus[iu]=a[i];
            }
            if(a[i]<0)
            {
                im++;
                mnus[im]=a[i];
            }
        }
        
        if(iu==0&&im<=1)
        {
            if(n==1&&im==1)
            cout<<a[1]<<endl;
            else
            cout<<"0"<<endl;
        }
        
        else
        {
            sort(mnus+1,mnus+im+1,cmp);
            sort(uminus+1,uminus+iu+1,cmp);
            ll ans=1;
            
            if(iu!=0)
            {
                for(int i=1;i<=iu;i++)
                ans*=uminus[i];
            }
            if(im>1)
            {
                for(int i=1;i<=2*(im/2);i++)
                ans*=mnus[i];
            }
            cout<<ans<<endl;
            
        }
        
    }
}