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.
for _ in range(int(input())):
    n=int(input())
    ar=list(map(int,input().split()))
    # print(ar)
    

    if n==5:
        p=1
        
        for i in ar:
            p*=i
        print(p)

    else:
        neg=[]
        pos=[]

        for i in ar:
            if i<0:
                neg.append(abs(i))
            else:
                pos.append(i)

        neg.sort(reverse=True)
        pos.sort(reverse=True)


        # print(neg,pos)
        

        
        p1=1
        p2=1
        p3=1

        ans=[]
        if len(pos)==0:
            nnn=neg[::-1]
            aaa=1
            for i in range(5):
                aaa*=nnn[i]
            print(aaa*-1)

        else:
            try:
                for i in range(4):
                    p1*=neg[i]
                for i in range(1):
                    p1*=pos[i]

                ans.append(p1)
            except:
                no=1
            
            try:
                for i in range(2):
                    p2*=neg[i]
                for i in range(3):
                    p2*=pos[i]
                ans.append(p2)
            except:
                no=1
            try:
                for i in range(5):
                    p3*=pos[i]
                ans.append(p3)
            except:
                no=1

            print(max(ans))

                
                

            

