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 math import inf
def solve():
    z=[]
    p=[]
    n=[]
    for v in a:
        if v>0:
            p.append(v)
        elif v<0:
            n.append(v)
        else:
            z.append(v)
    p.sort()
    n.sort()
    #print(p,n)
    if (not p) and (not n):
        print(0)
    elif not n:
        if len(p)>=5:
            print(p[-1]*p[-2]*p[-3]*p[-4]*p[-5])
        else:
            print(0)
    elif not p:
        if z:
            print(0)
        else:
            print(n[-1]*n[-2]*n[-3]*n[-4]*n[-5])
            
    elif not p and not z:
        print(n[-1]*n[-2]*n[-3]*n[-4]*n[-5])
    else:
        
        ans=-inf
        try:
            tmp=p[-1]*p[-2]*p[-3]*p[-4]*p[-5]
            ans=max(ans,tmp)
        except:
            pass
        try:
            tmp=n[0]*p[-1]*p[-2]*p[-3]*p[-4]
            ans=max(ans,tmp)
        except:
            pass
        try:
            tmp=n[0]*n[1]*p[-1]*p[-2]*p[-3]
            ans=max(ans,tmp)
        except:
            pass
        try:
            tmp=n[0]*n[1]*n[2]*p[-1]*p[-2]
            ans=max(ans,tmp)
        except:
            pass
        try:
            tmp=n[0]*n[1]*n[2]*n[3]*p[-1]
            ans=max(ans,tmp)
        except:
            pass
        try:
            tmp=n[0]*n[1]*n[2]*n[3]*n[4]
            ans=max(ans,tmp)
        except:
            pass
        if ans<0 and z:
            ans=0
        print(ans)

for _ in range(int(input())):
    num=int(input())
    a=list(map(int,input().split( )))
    solve()