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.
import sys,math
input=sys.stdin.readline
t=int(input())
def takeproduct(l):
    ans = 1
    for i in l:
        ans *= i
    return ans
for r in range(t):
    n = int(input())
    l = list(map(int,input().split()))
    pos = []
    neg = []
    for i in range(n):
        if l[i] >= 0:
            pos.append(l[i])
        else:
            neg.append(l[i])
    pos.sort()
    neg = sorted(neg, reverse = True)
    posrev = pos[::-1]
    negrev = neg[::-1]
    toggle = 1
    ans = -999999999999999999999999
    # print(pos,neg)
    for i in range(6):
        if toggle == 1:
            temp1 = pos[:i]
            temp2 = neg[:(5-i)]
            tempans = takeproduct(temp1) * takeproduct(temp2)
            if len(temp1) + len(temp2) == 5:
                ans = max(ans, tempans)
            toggle = 0
        else:
            temp1 = posrev[:i]
            temp2 = negrev[:(5-i)]
            tempans = takeproduct(temp1) * takeproduct(temp2)
            if len(temp1) + len(temp2) == 5:
                ans = max(ans, tempans)
            toggle = 1
    print(ans)

