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.
#!/usr/bin/env python3
# created : 2020. 12. 31. 23:59

import os
from sys import stdin, stdout


def solve(tc):
    n = int(stdin.readline().strip())
    seq = list(map(int, stdin.readline().split()))

    zero = 0
    minus = []
    plus = []
    for i in range(n):
        if seq[i] > 0:
            plus.append(seq[i])
        elif seq[i] < 0:
            minus.append(seq[i])
        else:
            zero += 1

    plus = sorted(plus)
    minus = sorted(minus)

    ans = -int(1e18)
    if len(plus) >= 5:
        val = 1
        for i in range(-1, -6, -1):
            val *= plus[i]
        ans = max(ans, val)

    if len(plus) >= 3 and len(minus) >= 2:
        val = 1
        for i in range(2):
            val *= minus[i]
        for i in range(-1, -4, -1):
            val *= plus[i]
        ans = max(ans, val)

    if len(plus) >= 1 and len(minus) >= 4:
        val = 1
        for i in range(4):
            val *= minus[i]
        val *= plus[-1]
        ans = max(ans, val)

    if zero > 0:
        ans = max(ans, 0)

    seq = sorted(seq, key=lambda x: -x if x < 0 else x)
    val = 1
    for i in range(5):
        val *= seq[i]
    ans = max(ans, val)

    print(ans)


tcs = 1
tcs = int(stdin.readline().strip())
tc = 1
while tc <= tcs:
    solve(tc)
    tc += 1
