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.
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################
for ii in range(int(input())):
	n = int(input())
	arr = list(map(int , input().split()))
	ans = -float("inf")
	arr.sort()
	#print(arr)
	if n == 5:
		print(arr[n-1]*arr[n-2]*arr[n-3]*arr[n-4]*arr[n-5])
		continue
	ans = max(ans , arr[n-1]*arr[n-2]*arr[n-3]*arr[n-4]*arr[n-5])
	#print("!!!",ans)
	ans = max(ans , arr[n-1]*arr[n-2]*arr[n-3]*arr[n-4]*arr[0])
	#print("!!!",ans)
	ans = max(ans , arr[n-1]*arr[n-2]*arr[n-3]*arr[1]*arr[0])
	#print("!!!",ans)
	ans = max(ans , arr[n-1]*arr[n-2]*arr[2]*arr[1]*arr[0])
	#print("!!!",ans)
	ans = max(ans , arr[n-1]*arr[3]*arr[2]*arr[1]*arr[0])
	#print("!!!",ans)
	ans = max(ans , arr[4]*arr[3]*arr[2]*arr[1]*arr[0]) #print("!!!",ans)
	print(ans)
	
	
	'''
	for i in range(n):
		for j in range(i+1,n):
			for k in range(j+1,n):
				for l in range(k+1,n):
					for t in range(l+1,n):
						temp = arr[i]*arr[j]*arr[k]*arr[l]*arr[t]
						ans = max(temp,ans)
						'''









'''
# Wrap solution for more recursion depth
#submit as python3
import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''
