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

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return map(int, minp().split())

def solve():
	n = mint()
	a = []
	b = []
	zero = False
	for i in mints():
		if i < 0:
			a.append(i)
		elif i > 0:
			b.append(i)
		else:
			zero = True
	a.sort()
	b.sort(reverse=True)
	r = None
	#print(a,b)
	for i in range(6):
		if len(a) >= i and len(b) >= 5-i:
			x = 1
			#z = []
			if i % 2 == 1:
				for j in range(-1,-i-1,-1):
					x *= a[j]
					#z.append(a[j])
				for j in range(-1,-(5-i)-1,-1):
					x *= b[j]
					#z.append(b[j])
			else:
				for j in range(i):
					x *= a[j]
					#z.append(a[j])
				for j in range(5-i):
					x *= b[j]
					#z.append(b[j])
			#print(z)
			if r == None or x > r:
				r = x
	if zero:
		if r == None or 0 > r:
			r = 0
	print(r)


for i in range(mint()):
	solve()
