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())):
    tam = int(input())
    numeros = list(map(int,input().split()))
    zeros = 0
    hay0 = False
    numPos = []
    numNeg = []
    for i in range(tam):
        if numeros[i]<0:
            numNeg.append(numeros[i])
        else:
            if numeros[i]==0:
                hay0 = True
                zeros +=1
            else:
                numPos.append(numeros[i])
    if len(numPos)+len(numNeg)<5:
        print(0)
        continue
    aux = len(numeros)
    ashuda = 0
    while zeros>0 and aux>5 and ashuda<len(numeros):
        if numeros[ashuda]==0:
            numeros.pop(ashuda)
            aux= aux - 1
            zeros= zeros - 1
        ashuda+=1      
    if len(numeros) == 5:
        result = 1
        for i in range(5):
            result = result * numeros[i]
        if hay0 and result<0:
            print(0)
            continue 
        print(result)
        continue
    numPos.sort()
    numNeg.sort()
    numerosFinal = []
    numPos.reverse()
    posibles = []

    if len(numPos) >= 1 and len(numNeg) >=4:
        numerosFinal.append(numPos[0])
        numerosFinal.append(numNeg[0])
        numerosFinal.append(numNeg[1])
        numerosFinal.append(numNeg[2])
        numerosFinal.append(numNeg[3])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    if len(numNeg) >= 1 and len(numPos) >=4:
        numerosFinal.append(numNeg[-1])
        numerosFinal.append(numPos[0])
        numerosFinal.append(numPos[1])
        numerosFinal.append(numPos[2])
        numerosFinal.append(numPos[3])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    if len(numNeg) >= 2 and len(numPos) >= 3:
        numerosFinal.append(numPos[0])
        numerosFinal.append(numNeg[0])
        numerosFinal.append(numNeg[1])
        numerosFinal.append(numPos[1])
        numerosFinal.append(numPos[2])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    if len(numPos) >= 2 and len(numNeg) >= 3:
        numerosFinal.append(numNeg[-1])
        numerosFinal.append(numPos[0])
        numerosFinal.append(numPos[1])
        numerosFinal.append(numNeg[-2])
        numerosFinal.append(numNeg[-3])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    if len(numPos) >= 5:
        numerosFinal.append(numPos[0])
        numerosFinal.append(numPos[1])
        numerosFinal.append(numPos[2])
        numerosFinal.append(numPos[3])
        numerosFinal.append(numPos[4])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    if len(numNeg) >= 5:
        numerosFinal.append(numNeg[-1])
        numerosFinal.append(numNeg[-2])
        numerosFinal.append(numNeg[-3])
        numerosFinal.append(numNeg[-4])
        numerosFinal.append(numNeg[-5])
        result = 1
        for i in range(5):
            result = result * numerosFinal[i]
        posibles.append(result)
        numerosFinal.clear()

    posibles.sort()
    if hay0 and posibles[-1]<0:
        print(0)
        continue
    print(posibles[-1])