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 collections import deque as dq
from collections import defaultdict as dd
from collections import Counter as ct
from functools import lru_cache as lc
from heapq import heappush as hpush, heappop as hpop, heapify as hfy
from bisect import bisect_left, bisect_right
import itertools as it
import math
import sys
#sys.setrecursionlimit(10**9)
input=sys.stdin.readline
####################################################################
def solve() :
	n = int(input())
	A = list(map(int, input().split()))
	B = [a for a in A if a > 0]
	C = [a for a in A if a < 0]

	if len(B) + len(C) < 5 :
		print(0)
		return
	
	B.sort(key = lambda x : -x)
	C.sort()
	
	ret = -float('inf')
	if 0 in A :
		ret = 0

	for m_cnt in range(6) :
		p_cnt = 5 - m_cnt
		if p_cnt > len(B) or m_cnt > len(C) :
			continue

		candi = 1
		for i in range(p_cnt) :
			candi *= B[i]
		for i in range(m_cnt) :
			candi *= C[i]
		ret = max(ret, candi)

		candi = 1
		for i in range(p_cnt) :
			candi *= B[-i-1]
		for i in range(m_cnt) :
			candi *= C[-i-1]
		ret = max(ret, candi)

	print(ret)
t = int(input())
#t = 1
for i in range(t) :
	#print("Case #" + str(i+1) + ": ", end = "")
	solve()