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.
for _ in range(int(input())):
    n = int(input())
    arr = list(map(int, input().split()))
    # arr.sort(key=lambda x: -abs(x))
    #
    # ans = arr[0] * arr[1] * arr[2] * arr[3] * arr[4]
    # p = ans
    # t = arr[:5]
    # if ans == 0:
    #     print(0)
    #     continue

    lower, higher = [], []
    zeros = False
    for i in arr:
        if i < 0:
            lower.append(i)
        elif i > 0:
            higher.append(i)
        else:
            zeros = True
    lower.sort()
    higher.sort(reverse=True)

    if len(higher) >= 5:
        a = higher[0] * higher[1] * higher[2] * higher[3] * higher[4]
    else:
        a = -(10 ** 18)
    if len(lower) >= 2 and len(higher) >= 3:
        b = lower[0] * lower[1] * higher[0] * higher[1] * higher[2]
    else:
        b = -(10 ** 18)
    if len(lower) >= 4 and len(higher) >= 1:
        c = lower[0] * lower[1] * lower[2] * lower[3] * higher[0]
    else:
        c = -(10 ** 18)

    if len(lower) >= 1 and len(higher) >= 4:
        d = lower[-1] * higher[0] * higher[1] * higher[2] * higher[3]
    else:
        d = -(10 ** 18)
    if len(lower) >= 3 and len(higher) >= 2:
        e = lower[-1] * lower[-2] * lower[-3] * higher[0] * higher[1]
    else:
        e = -(10 ** 18)
    if len(lower) >= 5:
        f = lower[-1] * lower[-2] * lower[-3] * lower[-4] * lower[-5]
    else:
        f = -(10 ** 18)

    ans = max(a, b, c, d, e, f)
    if zeros:
        ans = max(ans, 0)
    print(ans)
