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
import math
input = sys.stdin.readline

cases = int(input())
for case in range(cases):
    n = int(input())
    a = [int(x) for x in input().split()]
    mxp = []
    mxm = []
    a.sort()
    cnt = 0
    flag = False
    allbad = True
    for i in range(len(a)):
        if a[i] != 0:
            cnt += 1
        else:
            flag = True
        if a[i] > 0:
            allbad = False
    if cnt < 5:
        print(0)
        continue
    if not allbad:
        for i in range(5):
            if a[i] < 0:
                mxm.append(a[i])
    else:
        for i in range(len(a) - 1, len(a) - 6, -1):
            mxm.append(a[i])
    for i in range(len(a) - 1, len(a) - 6, -1):
        if a[i] > 0:
            mxm.append(a[i])
    tog = []
    for i in range(len(mxm)):
        tog.append(mxm[i])
    for i in range(len(mxp)):
        tog.append(mxp[i])
    ans = -(10 ** 18)
    for i in range(len(tog) - 4):
        for j in range(i + 1, len(tog) - 3):
            for k in range(j + 1, len(tog) - 2):
                for l in range(k + 1, len(tog) - 1):
                    for m in range(l + 1, len(tog)):
                        ans = max(ans, tog[i] * tog[j] * tog[k] * tog[l] * tog[m])
    if flag and ans < 0:
        ans = 0
    print(ans)