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.
"""
Code of Ayush Tiwari
Codeforces: servermonk
Codechef: ayush572000

"""
import sys
input = sys.stdin.buffer.readline

def solution():
    
    # This is the main code
    n=int(input())
    l=list(map(int,input().split()))
    if n==5:
        ans=1
        for i in range(n):
            ans*=l[i]
    else:
        l.sort()
        if max(l)==0:
            ans=0
        elif max(l)<0:
            ans=1
            i=n-1
            cnt=0
            while cnt!=5:
                ans*=l[i]
                i-=1
                cnt+=1 
        else:
            ans=1
            i = 0 
            j = n - 1
            k=5
            
            if (k & 1): 
                ans *= l[j] 
                j-= 1
                k-=1
    
            k >>= 1
            for itr in range( k) : 
  
                left_product = l[i] * l[i + 1] 
 
                right_product = l[j] * l[j - 1] 
         
                if (left_product > right_product) : 
                    ans *= left_product 
                    i += 2
                
                else : 
                    ans *= right_product 
                    j -= 2
    print(ans)
t=int(input())
for _ in range(t):
    solution()