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.
from sys import stdin,stdout
from math import gcd,log2,log10,floor,ceil;
import math;
from collections import defaultdict,OrderedDict
from bisect import bisect_left
# import numpy as np
# input=stdin.readline
# print=stdout.write
def function(pos,neg,noofpos):
    res=1;
    if noofpos==0:
        for i in range(5):
            a=max(neg)
            neg.remove(a)
            res*=a;
        return res;
    for i in range(noofpos):

        a=max(pos)
        res*=a;
        pos.remove(a)
    for i in range(5-noofpos):
        if len(neg)==0:
            return float("-inf")
        a=min(neg)
        res*=a;
        neg.remove(a)
    return res;
def fun(pos,neg,n):
    if n==5:
        res=1;
        for i in pos:
            res*=i;
        for i in neg:
            res*=i;
        return res;
    if len(pos)==0:
        return function(pos,neg,0)
    if len(neg)==0:
        return function(pos.copy(),neg.copy(),5)
    if len(pos)<=2:
        return function(pos,neg,1)
    if len(pos)<=4:
        return max(function(pos.copy(),neg.copy(),3),function(pos.copy(),neg.copy(),1))
    return max(function(pos.copy(),neg.copy(),3),function(pos.copy(),neg.copy(),1),function(pos.copy(),neg.copy(),5))

for i in range(int(input())):
    n=int(input())
    a=list(map(int,input().split()))
    pos=[];neg=[];
    for i in a:
        if i<0:
            neg.append(i)
        else:
            pos.append(i)
    neg.sort();pos.sort()
    # print(neg,pos)
    ans=fun(pos,neg,n)
    print(ans)

    




