#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

int N;
long long a[100];

void input() {
    scanf("%d",&N);
    for(int i = 1 ; i <= N ; i ++) {
        scanf("%I64d",&a[i]);
    }
    if(N==1) {
        printf("%I64d\n",a[1]);
        return ;
    }
    sort(a+1,a+N+1);
    int negnum = 0;
    for(int i = 1 ; i <= N ; i ++) {
        if(a[i] < 0) {
            negnum ++;
        }
    }
    int zero = 0;
    for(int i = 1 ; i <= N ; i ++) {
        if(a[i] == 0) {
            zero ++;
        }
    }
    if(zero == N || ((zero == N - 1) && (negnum == 1))) {
        puts("0");
        return;
    } 
    if(negnum % 2) {
        long long minn = a[1]; 
        int pos = 1;
        for(int i = 2 ; i <= N ; i ++) {
            if(a[i] < 0) {
                minn = max(minn,a[i]);
                pos = i;
            }
        }
        a[pos] = 1;
    }
    long long ANS = 1;
    for(int i = 1 ; i <= N ; i++) {
        if(a[i] == 0) continue;
        ANS = ANS * a[i];
    }
    printf("%I64d\n",ANS);
}

int main(void) {
    //freopen("a.in","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--) {
        input();
//        solve();
    }
    return 0;
}

/*
5
3
0 0 1
3
-1 0 0 
3
0 0 0 
3
-1 -2 -3
3 
-1 -2 1
*/