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
import math
from collections import defaultdict,Counter

# input=sys.stdin.readline
# def print(x):
#     sys.stdout.write(str(x)+"\n")

# sys.stdout=open("CP1/output.txt",'w')
# sys.stdin=open("CP1/input.txt",'r')

# mod=pow(10,9)+7
t=int(input())
for i in range(t):
	n=int(input())
	a=list(map(int,input().split()))
	pos=[]
	neg=[]
	for j in a:
		if j>=0:
			pos.append(j)
		else:
			neg.append(j)
	pos.sort(reverse=True)
	neg.sort()
	ans=1
	if len(pos)==0:
		for j in range(1,6):
			ans*=neg[-j]
	elif len(pos)<=2:
		if len(neg)>=4:
			for j in range(4):
				ans*=neg[j]
			ans*=pos[0]
		else:
			for j in range(3):
				ans*=neg[j]
			ans*=pos[0]*pos[1]
	elif len(pos)<=4:
		ans=0
		cur=1
		if len(neg)>=4:
			for j in range(4):
				cur*=neg[j]
			cur*=pos[0]
			ans=cur
		if len(neg)>=2:
			ans=max(ans,pos[0]*pos[1]*pos[2]*neg[0]*neg[1])
		if len(neg)==1:
			ans=1
			for j in range(4):
				ans*=pos[j]
			ans*=neg[0]
	else:
		ans=0
		if len(neg)>=4:
			cur=1
			for j in range(4):
				cur*=neg[j]
			cur*=pos[0]
			ans=cur
		if len(neg)>=2:
			ans=max(ans,pos[0]*pos[1]*pos[2]*neg[0]*neg[1])
		cur=1
		for j in range(5):
			cur*=pos[j]
		ans=max(ans,cur)
	print(ans)