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 os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
t=int(input())
for _ in range(t):
  n=int(input())
  a=list(map(int,input().split()))
  negatives=[]
  zero=0
  positives=[]
  for i in range(n):
    if a[i]<0:
      negatives.append(a[i])
    if a[i]>=0:
      positives.append(a[i])
  negatives.sort()
  positives.sort()
  if len(negatives)+len(positives)==5:
    ans=1
    for i in negatives:
      ans*=i
    for i in positives:
      ans*=i
    print(ans)
  elif len(positives)==0:
    print(negatives[-1]*negatives[-2]*negatives[-3]*negatives[-4]*negatives[-5])
  elif len(positives)<=2:
    print(negatives[0]*negatives[1]*negatives[2]*negatives[3]*positives[-1])
  elif len(positives)<=4:
    if len(negatives)>=4:
      print(max(negatives[0]*negatives[1]*negatives[2]*negatives[3]*positives[-1],negatives[0]*negatives[1]*positives[-2]*positives[-3]*positives[-1]))
    else:
      print(negatives[0]*negatives[1]*positives[-2]*positives[-3]*positives[-1])
  else:
    ans=positives[-1]*positives[-2]*positives[-3]*positives[-4]*positives[-5]
    if len(negatives)>=4:
      ans=max(negatives[0]*negatives[1]*negatives[2]*negatives[3]*positives[-1],ans)
    if len(negatives)>=2:
      ans=max(ans,negatives[0]*negatives[1]*positives[-2]*positives[-3]*positives[-1])
    print(ans)