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 sys import stdin, stdout

class SOLVE:
    def solve(self):
        R = stdin.readline
        #f = open('input.txt');R = f.readline
        W = stdout.write
        
        ans = []
        
        for i in range(int(R())):
            n = int(R())
            a = [int(x) for x in R().split()]
            a.sort(reverse = True)
            a = ['xtra'] + a
            
            pos = neg = 0
            for j in range(1, n+1):
                if a[j] < 0:
                    neg += 1
                else:
                    pos += 1
            
            POS  = {}
            for j in range(1, min(6, pos+1)):
                if j == 1:
                    POS[j] = a[j]
                else:
                    POS[j] = POS[j-1] * a[j]
                    
            NEG1 = {}
            for j in range(pos+1, min(pos+6, pos+neg+1)):
                if j == pos+1:
                    NEG1[j-pos] = a[j]
                else:
                    NEG1[j-pos] = NEG1[j-pos-1] * a[j]
            
            NEG2 = {}
            for j in range(n, n-min(5, neg), -1):
                if j == n:
                    NEG2[n-j+1] = a[j]
                else:
                    NEG2[n-j+1] = NEG2[n-j] * a[j]
                    
                    
                    
            mx = -10000000000000000000
            for j in range(pos+1):
                if (j == 0) and (5 in NEG1):
                    mx = max(mx, NEG1[5])
                elif (j == 5) and (5 in POS):
                    mx = max(mx, POS[5])
                elif (j in POS) and ((5-j) in NEG1):
                    mx = max(mx, POS[j]*NEG1[5-j])
                    
                    
            for j in range(pos+1):
                if (j == 0) and (5 in NEG2):
                    mx = max(mx, NEG2[5])
                elif (j == 5) and (5 in POS):
                    mx = max(mx, POS[5])
                elif (j in POS) and ((5-j) in NEG2):
                    mx = max(mx, POS[j]*NEG2[5-j])
                    
            if neg >= 5:    
                for j in range(neg+1):
                    if (j == 0) and (5 in NEG2):
                        mx = max(mx, NEG2[5])
                    elif (j == 5) and (5 in NEG1):
                        mx = max(mx, NEG1[5])
                    elif (j in NEG1) and ((5-j) in NEG2):
                        mx = max(mx, NEG1[j]*NEG2[5-j])
                        
            ans.append(str(mx))
        
        W('\n'.join(ans))
        
def main():
    s = SOLVE()
    s.solve()
main()