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.Arrays;

public class competetive {
    public static void main(String[] args) throws java.lang.Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(java.io.FileDescriptor.out), "ASCII"), 512);
        int t = Integer.parseInt(br.readLine());
        while (t-- > 0) {
            int n=Integer.parseInt(br.readLine());
            String line=br.readLine();
            String []s=line.trim().split(" ");
            long[]a=new long[n];
            for(int i=0;i<n;i++){
                a[i]=Long.parseLong(s[i]);
            }
            Arrays.sort(a);
            long m1=a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4] * a[n - 5];
            if( a[n-1]>=0&&a[n-2]>=0&&a[n-3]>=0&&a[n-4]>=0&&a[n-5]>=0) {
                m1 =Math.max(m1, a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4] * a[n - 5]);
            }
            if( a[n-1]>=0&&a[n-2]>=0&&a[n-3]>0&&a[0]<0&&a[1]<0){
                m1=Math.max(m1,a[n-1]*a[n-2]*a[n-3]*a[0]*a[1]);
            }if( a[n-1]>=0&&a[3]<0&&a[2]<0&&a[0]<0&&a[1]<0){
                m1=Math.max(m1,a[n-1]*a[3]*a[2]*a[0]*a[1]);
            }
            out.write(String.valueOf(m1));
            out.newLine();


        }
        out.flush();
    }

}
