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.
t = int(input())
for _ in range(t):
    n = int(input())
    neg = []
    pos = []
    z = 0
    for x in map(int, input().split()):
        if x > 0:
            pos.append(x)
        elif x < 0:
            neg.append(x)
        else:
            z += 1
    lpos = len(pos)
    lneg = len(neg)
    if lpos + lneg < 5 or (lpos == 0 and z > 0):
        print(0)
    elif lpos == 0:
        neg.sort()
        prod = neg[-1]
        for i in range(4):
            prod *= neg[-2 - i]
        print(prod)
    else:
        pos.sort()
        neg.sort()
        prod = pos[-1]
        if (lpos-1) // 2 + lneg // 2 < 2:
            if z > 0:
                print(0)
            else:
                prod = 1
                for x in pos:
                    prod *= x
                for x in neg:
                    prod *= x
                print(prod)
        else:
            i_pos = -2
            i_neg = 0
            p_pos = 0
            p_neg = 0
            if i_pos + lpos > 0:
                p_pos = pos[i_pos] * pos[i_pos-1]
                i_pos -= 2
            if lneg - i_neg > 1:
                p_neg = neg[i_neg] * neg[i_neg+1]
                i_neg += 2
            # first pair
            if p_pos > p_neg:
                prod *= p_pos
                if i_pos + lpos > 0:
                    p_pos = pos[i_pos] * pos[i_pos-1]
                else:
                    p_pos = 0
            else:
                prod *= p_neg
                if lneg - i_neg > 1:
                    p_neg = neg[i_neg] * neg[i_neg+1]
                else:
                    p_neg = 0
            # second pair
            prod *= max(p_pos, p_neg)
            print(prod)
