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.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;





public class Main
{
	static long max=0;
	static void f(long[] gz,int i,int s,long has) {
		if(s==5) {
			max=Math.max(max, has);
			return;
		}
		if(i==gz.length) return;
		f(gz,i+1,s+1,has*gz[i]);
		f(gz,i+1,s,has);
		
	}
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		
		Scanner s=new Scanner(System.in);
		int t=s.nextInt();
		while(t--!=0) {
			int n=s.nextInt();
			
			long[] buf=new long[n];
			for(int i=0;i<n;i++) {
				buf[i]=s.nextLong();
				
			}
			Arrays.sort(buf);
			long[] gz=new long[] {buf[0],buf[1],buf[2],buf[3],buf[4],buf[n-5],buf[n-4]
					,buf[n-3],buf[n-2],buf[n-1]};
			if(n<=10) gz=buf.clone();
			max=1;
			for(int i=0;i<5;i++) {
				max*=gz[i];
			}
			f(gz,0,0,1);
			System.out.println(max);
		}
	}

}