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.
#Codeforces Round #670
#Problem B
import sys

#
#BEGIN TEMPLATE
#
def input(): return sys.stdin.readline()[:-1]
def getInt(): return int(input())
def getIntIter(): return map(int, input().split())
def getIntList(): return list(getIntIter())
def flush(): sys.stdout.flush()
#
#END TEMPLATE
#

for _ in range(getInt()):
    n = getInt()
    nums = getIntList()
    pos = []
    neg = []
    zero = 0
    for num in nums:
        if num > 0:
            pos.append(num)
        if num < 0:
            neg.append(num)
        if num == 0:
            zero += 1
    if len(pos) + len(neg) < 5:
        print(0)
    else:
        pos.sort()
        neg.sort()
        if len(pos) < 5 and len(pos) % 2 == 0 and len(pos) + len(neg) == 5:
            if zero != 0:
                print(0)
            else:
                pos.extend(neg)
                prod = 1
                for item in pos:
                    prod *= item
                print(prod)
        elif len(pos) == 0:
            if zero != 0:
                print(0)
            else:
                print(neg[-1]*neg[-2]*neg[-3]*neg[-4]*neg[-5])
        else:
            prod = pos[-1]
            pairs = []
            if len(pos) >= 3:
                pairs.append(pos[-2]*pos[-3])
            if len(pos) >= 5:
                pairs.append(pos[-4]*pos[-5])
            if len(neg) >= 2:
                pairs.append(neg[0]*neg[1])
            if len(neg) >= 4:
                pairs.append(neg[2]*neg[3])
            pairs.sort()
            print(prod * pairs[-1] * pairs[-2])
