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 sys
# sys.stdin=open('D:/i.txt','r')
for t in range(int(input())):
	n=int(input())
	a=[int(x) for x in input().split(' ')]
	pv=[]
	nv=[]
	z=[]
	for x in a:
		if(x==0):
			z.append(x)
		elif(x>0):
			pv.append(x)
		else:
			nv.append(x)
	if((len(pv)+len(nv))<5):
		print(0)
		continue
	if((len(pv)>=5 and len(nv)>=0) or (len(pv)>=3 and len(nv)>=2) or (len(pv)>=1 and len(nv)>=4)):
		ppos=True
		a1=-1
		a2=-1
		a3=-1
		if((len(pv)>=5 and len(nv)>=0)):
			pv.sort()
			pv.reverse()
			a1=1
			for i in range(5):
				a1*=pv[i]
		if((len(pv)>=3 and len(nv)>=2)):
			a2=1
			pv.sort()
			pv.reverse()
			for i in range(3):
				a2*=pv[i]
			nv.sort()
			for i in range(2):
				a2*=nv[i]
		if((len(pv)>=1 and len(nv)>=4)):
			a3=1
			pv.sort()
			pv.reverse()
			for i in range(1):
				a3*=pv[i]
			nv.sort()
			for i in range(4):
				a3*=nv[i]
		print(max(a1,a2,a3))
		continue
	else:
		if(len(z)):
			print(0)
			continue
		else:
			b=[abs(x) for x in a]
			b.sort()
			print((-1)*(b[0]*b[1]*b[2]*b[3]*b[4]))
