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('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
mod = int(1e9)+7
def prod(p, n):
	if not n:
		return 1
	t = len(p)
	ans = 1
	for i in range (0,n):
		ans *= p[i]
	return ans
def np(n):
	if n==1:
		return int(input())
	else:
		return map(int, input().split())
for _ in range (0, int(input())):
	n = np(1)
	l = list(np(2))
	p,ne = [],[]
	for i in l:
		if i>=0:
			p.append(i)
		else:
			ne.append(i)
	ans = (-1 * int(1e18))
	# nz = 1
	p.sort(reverse = True)
	ne.sort()
	t = len(p)
	if len(p)>=5:
		ans = prod(p,5)
	x = len(ne)
	if not x:
		print(ans)
	elif not t:
		print(prod(ne[::-1],5))
	else:
		t1,t2 = 1, None
		for i in range (0, min(x,5)):
			t1*=ne[i]
			if t>=4-i:
				ans = max(t1*prod(p,4-i), ans)
		print(ans)