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
input = lambda: sys.stdin.readline()
for _ in range(int(input())):
	n = int(input())
	d = list(map(int,input().split()))
	a = sorted(d,key = lambda x:abs(x))
	flag = f = False
	cnt = 0
	neg = 0
	negg = 1
	for i in range(n):
		if a[i]>0:
			flag = True
		if a[i]==0:
			f = True
	if flag == False:
		if f==True:
			print(0)
		else:
			# print(a)
			print(a[0]*a[1]*a[3]*a[4]*a[2])
	else:
		f3 = True
		ans = [a[0]*a[1]*a[2]*a[3]*a[4]]
		pos = []
		neg = []
		poss = negg = 0
		# print(a)
		for i in range(n-1,-1,-1):
			if a[i]>=0:
				pos.append(a[i])
				poss+=1
			else:
				neg.append(a[i])
				negg+=1
		# print(pos,neg)
		if negg>=4 and poss>0:
			ans.append(neg[0]*neg[1]*neg[2]*neg[3]*pos[0])
		if (negg>=2) and poss>2:
			ans.append(neg[0]*neg[1]*pos[0]*pos[1]*pos[2])
		if poss>4:
			ans.append(pos[0]*pos[1]*pos[2]*pos[3]*pos[4])
		print(max(ans))
