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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class round670 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
		int test = Integer.parseInt(inp.readLine());
        while(test-->0)
        {
            int n = Integer.parseInt(inp.readLine());
            long arr[]=new long[n];
            String str[] = inp.readLine().split(" ");
            for(int i=0;i<n;i++){
                arr[i] = Integer.parseInt(str[i]);
            }
            //QuickSort(arr, 0, n-1);
            //System.out.println(Arrays.toString(arr));  
            Arrays.sort(arr);
            long pro1 = arr[n-1]*arr[n-2]*arr[n-3]*arr[n-4]*arr[n-5];
            long pro2 = arr[0]*arr[1]*arr[n-1]*arr[n-2]*arr[n-3];
            long pro3 = arr[0]*arr[1]*arr[2]*arr[3]*arr[n-1];
            long pro  = Math.max(pro1, Math.max(pro2, pro3));
            System.out.println(pro);   
        }
	}
	static void QuickSort(long arr[], int l, int h)
	{
		if(l<h)
		{
			int part = Pivot(arr, l, h);
			QuickSort(arr, l, part-1);
			QuickSort(arr, part+1, h);
		}
	}
	static int Pivot(long arr[], int l, int h)
	{
		long p = (arr[h]);;
		int i=l;
		for(int j=l;j<h;j++)
			if((arr[j]) < p) {
				long temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
				i++;
			}
		long temp = arr[i];
		arr[i] = arr[h];
		arr[h] = temp;
		return i;
	}
}
