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

for z in range(w):
    a = int(input())
    lista = list(map(int, input().split()))
    lista.sort()
    listmin = []
    listmax = []
    counter = 0
    b = 1
    for g in range(5):
        if lista[-g - 1] > -1:
            listmax.append(lista[-g - 1])
            counter += 1
        else:
            break
    if len(listmax) == 0:
        for i in range(5):
            listmin.append(lista[-1-i])
    elif (a - counter) > 4:
        for i in range(5):
            listmin.append(lista[i])
    else:
        for i in range(a - counter):
            if lista[i] < 0:
                listmin.append(lista[i])
            else:
                break
    listmax.sort()
    c = len(listmin)
    if c % 2 != 0:
        c -= 1
    y = len(listmax)
    if y % 2 == 0:
        y -= 1
    if a == 5:
        for l in range(5):
            b *= lista[l]
    elif y == -1:
        for l in range(5):
            b *= listmin[-l-1]
    elif y != 5:
        t = 5-y
        if len(listmax) - y == 1:
            listmax.remove(listmax[0])
        for k in range(t//2):
            listmax.append(listmin[0])
            listmax.append(listmin[1])
            listmin.remove(listmin[0])
            listmin.remove(listmin[0])
        if y == 3 and len(listmin) > 1:
            if listmin[0]*listmin[1] > listmax[0]*listmax[1]:
                listmax[0] = listmin[0]
                listmax[1] = listmin[1]
        for l in range(5):
            b *= listmax[l]
    else:
        for q in range(c//2):
            if listmin[2*q]*listmin[2*q+1] > listmax[2*q]*listmax[2*q + 1]:
                listmax[2*q] = listmin[2*q]
                listmax[2*q + 1] = listmin[2*q + 1]
        for l in range(5):
            b *= listmax[l]
    print(b)