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

t = int(stdin.readline())
for case in range(t):
    n = int(stdin.readline())
    arr = list(map(int, stdin.readline().split()))
    xx = []
    pos, neg = 0, 0
    for item in arr:
        if item >= 0:
            xx.append((item, 1))
            pos += 1
        else:
            xx.append((abs(item), -1))
            neg += 1
    xx.sort()
    ans = 1
    if pos == n:
        for pr in xx[-5:]:
            ans = ans * pr[0]
    elif neg == n:
        for pr in xx[:5]:
            ans = ans * pr[0] * pr[1]
    else:
        posv, negv = [], []
        for pr in xx[-5:]:
            ans = ans * pr[0] * pr[1]
            if pr[1] == -1:
                negv.append(pr[0] * pr[1])
            else:
                posv.append(pr[0])
        if ans < 0:
            rxp, rxn = [], []
            for pr in xx[:(n - 5)]:
                if pr[1] == 1:
                    rxp.append(pr[0])
                else:
                    rxn.append(pr[0] * pr[1])
            #print(posv, negv, rxp, rxn, ans)
            prv = ans
            if len(rxp) > 0 and len(negv) > 0:
                #print((ans // max(negv)) * max(rxp))
                ans = max(ans, (prv // max(negv)) * max(rxp))
            if len(rxn) > 0 and len(posv) > 0:
                #rint(ans, min(posv), min(rxn))
                ans = max(ans, (prv // min(posv)) * min(rxn))
    stdout.write("{}\n".format(ans))

