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.
import java.io.*;
import java.util.*;
public final class MaximumProduct
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter log = new BufferedWriter(new OutputStreamWriter(System.out));
        int t=Integer.parseInt(br.readLine());
        log.flush();
        int n;
        
        int pos,neg,i;
        long res;
        while(t-->0)
        {
            n=Integer.parseInt(br.readLine());
            long[] arr=new long[n];
            ArrayList<Long> ans=new ArrayList<>();
            StringTokenizer st=new StringTokenizer(br.readLine());
            for(i=0;i<n;i++)
            {
                arr[i]=Long.parseLong(st.nextToken());
            }
            res=1;
            Arrays.sort(arr);
            pos=neg=0;
            for(i=n-1;i>=n-5;i--)
            {
                if(arr[i]>=0)
                pos++;
                res*=arr[i];
            }

            for(i=0;i<4;i++)
            if(arr[i]<0)
            neg++;
            if(neg==4)
            res=Math.max(res,arr[0]*arr[1]*arr[2]*arr[3]*arr[n-1]);
            if(neg>=2)
            res=Math.max(res,arr[0]*arr[1]*arr[n-2]*arr[n-3]*arr[n-1]);

            log.write(res+"\n");

            


        }
        log.flush();
    }
}