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.
"""T=int(input())
for _ in range(0,T):
    n=int(input())
    a,b=map(int,input().split())
    s=input()
    s=[int(x) for x in input().split()]
    for i in range(0,len(s)):
        a,b=map(int,input().split())"""



T=int(input())
for _ in range(0,T):

    n=int(input())
    s=[int(x) for x in input().split()]
    arrp=[]
    arrn=[]
    for i in range(0,len(s)):
        if(s[i]<0):
            arrn.append(abs(s[i]))
        else:
            arrp.append(abs(s[i]))

    
    arrp.sort()
    arrn.sort()
    
    inf = (-3000)**5

    N = (2**5)
    dp=[inf]*N

    for i in range(N):
        tt=bin(i)
        tt=tt[2:]
        tt='0'*(5-len(tt))+tt


        c0=tt.count('0')
        c1=tt.count('1')

        if(c0%2!=0):
            mul=1
            if(len(arrn)<c0 or len(arrp)<c1):
                dp[i]=inf
            else:
                for j in range(c0):
                    mul*=arrn[j]
                for j in range(c1):
                    mul*=arrp[j]

                dp[i] = -mul

        else:
            mul=1
            if(len(arrn)<c0 or len(arrp)<c1):
                dp[i]=inf
            else:
                for j in range(len(arrn)-1,len(arrn)-c0-1,-1):
                    mul*=arrn[j]
                for j in range(len(arrp)-1,len(arrp)-c1-1,-1):
                    mul*=arrp[j]

                dp[i] = mul
        #print(dp[i])

    ans=inf
    for i in range(N):
        ans=max(ans,dp[i])

    print(ans)
                    
                
        
