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.
if __name__=="__main__":

    t=(int)(input())
    for i in range(t):
        n=int(input())
        l=list(map(int,input().split()))
        temp=[]
        ans=1
        if n==5:
            for j in range(n):
                ans*=l[j]
            print(ans)
            continue
        l.sort()
        neg=0
        negList=[]
        posList=[]
        pos=0
        for j in range(n):
            if l[j]<0:
                
                neg+=1
                
                
            else:
                break
                
        pos=len(l)-neg
        ans2=1
        ans3=1
        ans1=1
        if neg>=4 and pos>=5:
            flag1=0
            
            for j in range(4):
                if flag1==0:
                    ans2*=l[j]
                if j==1:
                    flag1=1
                ans1*=l[j]
            ans1*=l[-1]
            for j in range(n-1,n-1-3,-1):
                ans2*=l[j]
            for j in range(n-1,n-1-5,-1):
                ans3*=l[j]
            if ans1>=ans2 and ans1>=ans3:
                ans=ans1
            elif ans2>=ans1 and ans2>=ans3:
                ans=ans2
            else:
                ans=ans3
        
        elif neg>=2 and pos>=5:
            for j in range(n-1,n-1-5,-1):
                ans3*=l[j]
            
            for j in range(2):
                ans2*=l[j]
            for j in range(n-1,n-1-3,-1):
                ans2*=l[j]
            if ans2>=ans3:
                ans=ans2
            else:
                ans=ans3
         
        elif neg>=0 and pos>=5:
            for j in range(n-1,n-1-5,-1):
                ans3*=l[j]
            ans=ans3

        elif neg>=4 and pos>=3:
            flag1=0
            
            for j in range(4):
                if flag1==0:
                    ans2*=l[j]
                if j==1:
                    flag1=1
                ans1*=l[j]
            ans1*=l[-1]
            for j in range(n-1,n-1-3,-1):
                ans2*=l[j]
            
            if ans1>=ans2:
                ans=ans1
            else:
                ans=ans2
            
        elif neg>=4 and pos>=1:
            for j in range(4):
                
                ans1*=l[j]
            ans1*=l[-1]
            ans=ans1
         
        elif neg>=2 and pos>=3:
            for j in range(2):
                ans2*=l[j]
            for j in range(n-1,n-1-3,-1):
                ans2*=l[j]
            for j in range(n-1,n-1-5,-1):
                ans3*=l[j]

            if ans2>=ans3:
                ans=ans2
            else:
                ans=ans3
      
        else:
            for j in range(n-1,n-6,-1):
                ans*=l[j]
          

        print(ans)











                
            
            
            
            
            
