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 *
from math import *
t=int(input())
for _ in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    neg=[]
    pos=[]
    for i in range(n):
        if a[i]<0:
            neg.append(a[i])
        else:
            pos.append(a[i])
    l1=len(neg)
    l2=len(pos)
    neg.sort()
    pos.sort()
    pos=pos[::-1]
    ans=[]
    if l1>=5 and l2>=0:
        ans.append(neg[l1-2]*neg[l1-5]*neg[l1-3]*neg[l1-4]*neg[l1-1])
    if l1>=4 and l2>=1:
        ans.append(neg[0] * neg[1] * neg[2] * neg[3] * pos[0])
    if l1>=3 and l2>=2:
        ans.append(neg[l1-2] * neg[l1-3] * neg[l1-1] * pos[l2-1]*pos[l2-2])
    if l1>=2 and l2>=3:
        ans.append(neg[0] * neg[1] * pos[0]*pos[1]*pos[2])
    if l1>=1 and l2>=4:
        ans.append(neg[l1-1] * pos[l2-1] * pos[l2-2] * pos[l2-3] * pos[l2-4])
    if l1>=0 and l2>=5:
        ans.append(pos[4] * pos[3] * pos[0] * pos[1] * pos[2])
    print(max(ans))