You are given an array of integers a_1,a_2,…,a_n. Find the maximum possible value of a_ia_ja_ka_la_t among all five indices (i, j, k, l, t) (i<j<k<l<t).

Input

The input consists of multiple test cases. The first line contains an integer t (1≤ t≤ 2 ⋅ 10^4) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer n (5≤ n≤ 10^5) — the size of the array.

The second line of each test case contains n integers a_1,a_2,…,a_n (-3× 10^3≤ a_i≤ 3× 10^3) — given array.

It's guaranteed that the sum of n over all test cases does not exceed 2⋅ 10^5.

Output

For each test case, print one integer — the answer to the problem.

Example

Input


4
5
-1 -2 -3 -4 -5
6
-1 -2 -3 1 2 -1
6
-1 0 0 0 -1 -1
6
-9 -7 -5 -3 -2 1


Output


-120
12
0
945

Note

In the first test case, choosing a_1,a_2,a_3,a_4,a_5 is a best choice: (-1)⋅ (-2) ⋅ (-3)⋅ (-4)⋅ (-5)=-120.

In the second test case, choosing a_1,a_2,a_3,a_5,a_6 is a best choice: (-1)⋅ (-2) ⋅ (-3)⋅ 2⋅ (-1)=12.

In the third test case, choosing a_1,a_2,a_3,a_4,a_5 is a best choice: (-1)⋅ 0⋅ 0⋅ 0⋅ (-1)=0.

In the fourth test case, choosing a_1,a_2,a_3,a_4,a_6 is a best choice: (-9)⋅ (-7) ⋅ (-5)⋅ (-3)⋅ 1=945.
// package Div2_670;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class ProblemB {
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder print=new StringBuilder();
        StringTokenizer st;
        int test=Integer.parseInt(br.readLine());
        while(test--!=0){
            int n=Integer.parseInt(br.readLine());
            ArrayList<Integer> pos=new ArrayList<>();
            ArrayList<Integer> neg=new ArrayList<>();
            st=new StringTokenizer(br.readLine());
            for(int i=1;i<=n;i++){
                int x=Integer.parseInt(st.nextToken());
                if(x>=0){
                    pos.add(x);
                }
                else{
                    neg.add(x);
                }
            }
            Collections.sort(pos,Collections.reverseOrder());
            Collections.sort(neg);
            long max=Long.MIN_VALUE;
            if(pos.size()>=5){
                long temp=1;
                for(int i=0;i<5;i++){
                    temp*=pos.get(i);
                }
                max=Math.max(max,temp);
            }
            for(int i=1;i<=5;i++){
                if(neg.size()<i){
                    break;
                }
                long temp=1;
                boolean complete=false;
                if(i%2==0){
                    for(int j=0;j<i;j++){
                        temp*=neg.get(j);
                    }
                    int rem=5-i;
                    if(rem<=pos.size()){
                        for(int j=0;j<rem;j++){
                            temp*=pos.get(j);
                        }
                        complete=true;
                    }
                }
                else{
                    for(int j=neg.size()-1;j>=neg.size()-i;j--){
                        temp*=neg.get(j);
                    }
                    int rem=5-i;
                    if(rem<=pos.size()){
                        for(int j=pos.size()-1;j>=pos.size()-rem;j--){
                            temp*=pos.get(j);
                        }
                        complete=true;
                    }
                }
//                System.out.println(temp+" "+i);
                if(complete)
                max=Math.max(max,temp);
            }
            print.append(max).append("\n");
        }
        System.out.print(print.toString());
    }
}
