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.
t = int(input())
for _ in range(t):
    n = int(input())
    a = list(map(int, input().split()))
    nega = [i for i in a if i < 0]
    zero = [i for i in a if i == 0]
    plus = [i for i in a if i > 0]
    nega.sort(key=lambda x:abs(x), reverse=True)
    plus.sort(reverse=True)
    if len(nega) + len(plus) < 5:
        print(0)
    elif len(plus) == 0:
        if len(zero) >= 1:
            print(0)
        else:
            print(nega[-1] * nega[-2] * nega[-3] * nega[-4] * nega[-5])
    else:
        if len(nega) >= 4:
            if len(plus) >= 5:
                print(max(plus[0] * plus[1] * plus[2] * plus[3] * plus[4], nega[0] * nega[1] * plus[0] * plus[1] * plus[2], nega[0] * nega[1] * nega[2] * nega[3] * plus[0]))
            elif len(plus) >= 3:
                print(max(nega[0] * nega[1] * plus[0] * plus[1] * plus[2], nega[0] * nega[1] * nega[2] * nega[3] * plus[0]))
            elif len(plus) >= 1:
                print(nega[0] * nega[1] * nega[2] * nega[3] * plus[0])
            else:
                print(nega[-1] * nega[-2] * nega[-3] * nega[-4] * nega[-5] if len(zero) == 0 else 0)
        elif len(nega) >= 2:
            if len(plus) >= 5:
                print(max(plus[0] * plus[1] * plus[2] * plus[3] * plus[4], nega[0] * nega[1] * plus[0] * plus[1] * plus[2]))
            elif len(plus) >= 3:
                print(nega[0] * nega[1] * plus[0] * plus[1] * plus[2])
            else:
                print(nega[-1] * nega[-2] * nega[-3] * plus[-1] * plus[-2] if len(zero) == 0 else 0)
        else:
            if len(plus) >= 5:
                print(plus[0] * plus[1] * plus[2] * plus[3] * plus[4])
            else:
                print(nega[-1] * plus[-1] * plus[-2] * plus[-3] * plus[-4] if len(zero) == 0 else 0)