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 functools import reduce 
import sys
input=sys.stdin.readline
t=int(input())
while t:
    t-=1
    n=int(input())
    a=sorted(list(map(int,input().split())))
    if n==5:
        ans=reduce((lambda x, y: x * y),a)
        print(ans)
    else:
        nl=[]
        pl=[]
        for i in range(4):
            if a[i]<0:
                nl.append(a[i])
            else:
                break
        for i in range(n-1,n-6,-1):
            if a[i]>0:
                pl.append(a[i])
            else:
                break
        if len(pl)==0:
            ans=reduce((lambda x, y: x * y),a[n-5:n]) 
        elif len(nl)<2:
            ans=reduce((lambda x, y: x * y),a[n-5:n]) 
        elif (len(pl)>=3 and len(nl)>=2) or (len(pl)>=1 and len(nl)>=4) or len(pl)==5:
            ans1=ans2=ans3=1
            
            if len(pl)==5:
                ans1=reduce((lambda x, y: x * y),pl) 
            if len(pl)>=3:
                pp=1
                for i in range(3):
                    pp=pp*pl[i]
                np=nl[0]*nl[1]
                ans2=pp*np
            if len(nl)==4:
                ans3=reduce((lambda x, y: x * y),nl) 
                ans3=ans3*pl[0]
            ans=max(ans1,ans2,ans3)
        else:
            ans=0
        print(ans)
                