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.util.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
public class scaler
{
    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
    
    
    public static void main (String[] args) throws java.lang.Exception
    {
        FastReader sc = new FastReader();
        //System.out.print("hel");
        int t=sc.nextInt();
        PrintWriter out=new PrintWriter(System.out);
        Set<Long> st=new HashSet<Long>();
        long sum=0,sum1=0,sum2=0;
        int i,n,j,x=0,y=0,u,d,r,l,k;
        int E,H,A,B,C;
        int max,min;
        int t1,h;
        String s="",s1="";
        char ch;
        int c1,c2,c3;
        
        for(;t>0;t--)
        {
        	n=sc.nextInt();
        	long arr[]=new long[n];
        	for(i=0;i<n;i++)
        		arr[i]=sc.nextLong();
        	Arrays.sort(arr);
        	sum1=arr[n-1]*arr[n-2]*arr[n-3]*arr[n-4]*arr[n-5];
        	sum=arr[0]*arr[1]*arr[n-1]*arr[n-2]*arr[n-3];
        	sum2=arr[0]*arr[1]*arr[2]*arr[3]*arr[n-1];
         	out.println(Math.max(sum2, Math.max(sum1,sum)));
        }
        out.close();
    }
}