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
input = sys.stdin.readline

t=int(input())

for tests in range(t):
    n=int(input())
    A=list(map(int,input().split()))

    if n==5:
        print(A[0]*A[1]*A[2]*A[3]*A[4])
        continue

    P=[]
    M=[]
    Z=[]

    for a in A:
        if a>0:
            P.append(a)
        elif a<0:
            M.append(-a)
        else:
            Z.append(0)

    P.sort(reverse=True)
    M.sort(reverse=True)

    if len(P)==0:
        if len(Z)>0:
            print(0)
            continue
        else:
            print(M[-1]*M[-2]*M[-3]*M[-4]*M[-5]*(-1))
            continue

    MAX=0

    if len(P)>=5:
        MAX=max(MAX,P[0]*P[1]*P[2]*P[3]*P[4])

    if len(P)>=3 and len(M)>=2:
        MAX=max(MAX,P[0]*P[1]*P[2]*M[0]*M[1])

    if len(P)>=1 and len(M)>=4:
        MAX=max(MAX,P[0]*M[0]*M[1]*M[2]*M[3])

    print(MAX)
        
    

    

    
