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.
def main():
    t = int(input())
    for _ in range(t):
        n = int(input())
        A = [int(x) for x in input().split()]
        ans = 1
        if(n==5):
            for ele in A:
                ans *= ele
            print(ans)
            continue
        
        count_neg, count_pos, count_zer = 0,0,0
        pos = []
        neg = []
        for ele in A:
            if(ele<0):
                count_neg+=1
                neg.append(ele)
            elif(ele>0):
                count_pos+=1
                pos.append(ele)
            else:
                count_zer +=1
        #other than zeros only 5 or less element left
        if(n-count_zer<5):
            print(0)
            continue
        elif(n-count_zer == 5):
            ans = 1
            for ele in pos:
                ans *= ele
            for ele in neg:
                ans *= ele
            res = ans
            if(count_zer>0):
                if(res<0):
                    res = 0
            print(res)
            continue
        #number of positive + negative elements > 5
        pos.sort()
        neg.sort()
        a, b, c, d, e, f = [-243000000000000001 for i in range(6)]
        if(count_pos>=5):
            ans = 1
            for ele in pos[-5:]:
                ans *= ele
            if(a<ans):
                a = ans
        if(count_neg>=2 and count_pos>=3):
            ans = 1
            for ele in pos[-3:]:
                ans *= ele
            for ele in neg[:2]:
                ans *= ele
            if(b<ans):
                b = ans
        if(count_neg>=4 and count_pos>=1):
            ans = 1
            for ele in neg[:4]:
                ans *= ele
            ans*= pos[-1]
            if(c<ans):
                c = ans
        if(count_neg>=1 and count_pos>=4):
            ans = 1
            ans *= neg[-1]
            for ele in pos[:4]:
                ans *= ele
            if(d<ans):
                d = ans
        if(count_neg>=3 and count_pos>=2):
            ans = 1
            for ele in neg[-3:]:
                ans*= ele
            for ele in pos[:2]:
                ans *= ele
            if(e<ans):
                e = ans
        if(count_neg>=5):
            ans = 1
            for ele in neg[-5:]:
                ans *= ele
            if(f<ans):
                f = ans
        res = max([a,b,c,d,e,f])
        if(count_zer>0):
            if(res<0):
                res = 0
        print(res)
if __name__ == '__main__':
    main()