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 class Prb {

    static PrintWriter pw;
    static Scanner sc;
    static long mod = 1000000000+7;

    static void print(final String arg) {
      pw.write(arg);
      pw.flush();      
    }     

    static int ni(){
        return sc.nextInt();
    }
    static long nl(){
        return sc.nextLong();
    }

    static void runFile() throws Exception {

      sc = new Scanner(new FileReader("input.txt"));
      pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
    }

    static void runIo() throws Exception  {

      pw =new PrintWriter(System.out);
      sc = new Scanner(System.in);
    }    

    static boolean sv[] = new boolean[1000002];
 
    static void seive() {
        // true -> not prime
        // false-> prime

        sv[0] = sv[1] = true; 
        sv[2] = false;
        for(int i = 0; i< sv.length; i++) {
            if( !sv[i] && (long)i*(long)i < sv.length ) {
                for ( int j = i*i; j<sv.length ; j += i ) {                
                    sv[j] = true;
                }
            }
        }

    }
    
    static class Pair {
        int a ,b;
        Pair(int a, int b){
            this.a = a;
            this.b = b;
        }
    }

 
    public static void main(String[] args)  throws Exception {

        // runFile();

        runIo();    

        int t =  sc.nextInt();

        while( t-- > 0 ) {   
           
           int n = ni();
           long ar[] = new long[n];

           for(int i = 0; i<n;i++)
                ar[i] = nl();

            Arrays.sort(ar);

            long ans = 1;

            ans = ar[0]*ar[1]*ar[2]*ar[3]*ar[4];
            ans = Math.max(ans, ar[0]*ar[1]*ar[2]*ar[3]*ar[n-1]);
            ans = Math.max(ans, ar[0]*ar[1]*ar[2]*ar[n-2]*ar[n-1]);
            ans = Math.max(ans, ar[0]*ar[1]*ar[n-3]*ar[n-2]*ar[n-1]);
            ans = Math.max(ans, ar[0]*ar[n-4]*ar[n-3]*ar[n-2]*ar[n-1]);
            ans = Math.max(ans, ar[n-5]*ar[n-4]*ar[n-3]*ar[n-2]*ar[n-1]);

             print(ans+"\n");

        } 
        
    }              
} 
 