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.
num_cases = int(input())

for case in range(num_cases):
    num_ints = int(input())
    ints = [int(n) for n in input().split()]

    ints = sorted(ints)

    min = ints[0]
    max = ints[-1]

    if max < 0:
        ans = 1
        for i in range(1, 6):
            ans *= ints[-i]

    elif min > 0:
        ans = 1
        for i in range(1, 6):
            ans *= ints[-i]

    else:
        neg_count = 0
        for i in range(5):
            if ints[i] < 0:
                neg_count += 1
            else:
                break
        pos_count = 0
        for i in range(1, 6):
            if ints[-i] > 0:
                pos_count += 1
            else:
                break

        if neg_count >= 4:
            ans_1 = 1
            for i in range(4):
                ans_1 *= ints[i]
            ans_1 *= max

            ans_2 = 1
            for i in range(2):
                ans_2 *= ints[i]
            for i in range(1, 4):
                ans_2 *= ints[-i]

            ans_3 = 1
            for i in range(1, 6):
                ans_3 *= ints[-i]

            answers = [ans_1, ans_2, ans_3]
            ans = sorted(answers)[-1]

        elif neg_count >= 2:
            ans_1 = 1
            for i in range(2):
                ans_1 *= ints[i]
            for i in range(1, 4):
                ans_1 *= ints[-i]

            ans_2 = 1
            for i in range(1, 6):
                ans_2 *= ints[-i]

            ans = sorted([ans_1, ans_2])[-1]

        elif neg_count >= 0:
            ans = 1
            for i in range(1, 6):
                ans *= ints[-i]

    print(ans)