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.
#!/usr/bin/env pypy3

from sys import stdin, stdout
 
def input():
    return stdin.readline().strip()


def ans_slow(A):
	A = sorted(A)
	neg = [a for a in A if a < 0]
	pos = [a for a in A if a > 0]
	zer = [a for a in A if a == 0]

	A = neg+pos+zer

	ret = float("-inf")

	for i in range(0, len(A)):
		for j in range(i+1, len(A)):
			for k in range(j+1, len(A)):
				for l in range(k+1, len(A)):
					for t in range(l+1, len(A)):
						ret = max(ret, A[i]*A[j]*A[k]*A[l]*A[t])

	return ret

def prod(A):
	ret = 1
	for a in A:
		ret *= a
	return ret
	
def ans(A):
	A = sorted(A)
	neg = [a for a in A if a < 0]
	pos = [a for a in A if a > 0]
	zer = [a for a in A if a == 0]

	if len(pos) == 0 and len(zer) == 0:
		return prod(neg[::-1][0:5])

	if len(zer) >= 5:
		zer = [0]*5

	if len(neg) >= 5:
		neg = neg[:5]
	
	if len(pos) >= 5:
		pos = pos[len(pos)-5:]

	assert(len(zer) <= 5)
	assert(len(pos) <= 5)
	assert(len(neg) <= 5)

	A = neg+pos+zer

	ret = float("-inf")

	for i in range(0, len(A)):
		for j in range(i+1, len(A)):
			for k in range(j+1, len(A)):
				for l in range(k+1, len(A)):
					for t in range(l+1, len(A)):
						ret = max(ret, A[i]*A[j]*A[k]*A[l]*A[t])

	return ret

if False:
	import random
	for _ in range(10000):
		test_case = [random.randint(-3, 3) for _ in range(12)]
		if ans(test_case) != ans_slow(test_case):
			print(test_case)
else:
	T = int(input())
	for t in range(T):
		input()
		A = list(map(int, input().split()))
		print(ans(A))