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.
from sys import stdin
input = stdin.readline
T = int(input())
for t in range(1,T + 1):
	n = int(input())
	_input = list(map(int,input().split()))
	neg = []; pos = []
	zero = False
	for i in _input:
		zero += (i == 0)
		if i > 0:
			pos.append(i)
		else:
			if i < 0:
				neg.append(i)
	if len(neg) == 0:
		if len(pos) < 5:
			print(0)
		else:
			pos.sort(reverse = True)
			print(pos[0] * pos[1] * pos[2] * pos[3] * pos[4])
	elif len(pos) == 0:
		if zero:
			print(0)
		else:
			neg.sort(reverse = True)
			print(neg[0] * neg[1] * neg[2] * neg[3] * neg[4])
	else:
		ans = 1
		if len(pos) + len(neg) == 5:
			for i in pos:
				ans *= i
			for i in neg:
				ans *= i
			if zero and ans < 0:
				print(0)
			else:
				print(ans)
			continue
		one = two = three = four = five = 1
		pos.sort(reverse = True)
		neg.sort()
		for i in range(len(pos)):
			if i < 1:
				one = pos[i]
				three = five = one
			else:
				if i < 3:
					three *= pos[i]
					five = three
				else:
					five *= pos[i]
			if i + 1 == 5:
				break
		for i in range(len(neg)):
			if i < 2:
				two *= neg[i]
				four = two
			else:
				four *= neg[i]
			if i + 1 == 4:
				break
		ans = -11111111111111
		if len(neg) >= 2 and len(pos) >= 3:
			ans = max(ans,two * three)
		if len(neg) >= 4 and len(pos) >= 1:
			ans = max(ans,one * four)
		if len(pos) >= 5:
			ans = max(ans,five)
		if ans < 0 and zero:
			ans = 0
		print(ans)
			
