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.
#mod = 10**9+7
 
import sys
input = sys.stdin.buffer.readline
 
def main():
    t = int(input())
    for _ in range(t):
        #n, k = map(int, input().split())
        n = int(input())
        k = 5
        A = list(map(int, input().split()))
     
        PZ = []
        N = []
        for a in A:
            if a >= 0:
                PZ.append(a)
            else:
                N.append(a)
     
        flag = True
        if len(PZ) > 0:
            if n == k:
                if len(N)%2 != 0:
                    flag = False
        else:
            if k%2 != 0:
                flag = False
     
        if flag:
            if k%2 == 0:
                PZ.sort(reverse=True)
                N.sort()
                s = len(PZ)
                t = len(N)
                C = []
                for i in range(s//2):
                    C.append(PZ[2*i]*PZ[2*i+1])
                for i in range(t//2):
                    C.append(N[2*i]*N[2*i+1])
                C.sort(reverse=True)
                ans = 1
                for i in range(k//2):
                    ans *= C[i]
                    #ans %= mod
            else:
                PZ.sort()
                ans = PZ.pop()
                PZ.reverse()
                N.sort()
                s = len(PZ)
                t = len(N)
                C = []
                for i in range(s//2):
                    C.append(PZ[2*i]*PZ[2*i+1])
                for i in range(t//2):
                    C.append(N[2*i]*N[2*i+1])
                C.sort(reverse=True)
                for i in range(k//2):
                    ans *= C[i]
                    #ans %= mod
        else:
            ABS = [abs(a) for a in A]
            ABS.sort()
            ans = 1
            for i in range(k):
                ans *= ABS[i]
                #ans %= mod
            ans *= -1
            #ans %= mod
        print(ans)
 
if __name__ == '__main__':
    main()