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.
for _ in range(int(input())):
    n=int(input())
    a=[int(x) for x in input().split()]
    pos=[]
    neg=[]
    for i in a:
        if i>=0:
            pos.append(i)
        else:
            neg.append(i)
    pos.sort(reverse=True)
    neg.sort()
    x=pos[:5]
    y=neg[:5]
    l=x+y
    m=len(l)
    max=-100000000000000000000000000000000000
    for i in range(m):
        for j in range(i+1,m):
            for k in range(j+1,m):
                for o in range(k+1,m):
                    for p in range(o+1,m):
                        ans=l[i]*l[j]*l[k]*l[o]*l[p]
                        if ans>max:
                            max=ans
    if max<0:
        m1=len(pos)
        m2=len(neg)
        if m1==0:
            ans=neg[-1]*neg[-5]*neg[-2]*neg[-3]*neg[-4]
        elif m1==2:
            ans=pos[-1]*pos[-2]*neg[-1]*neg[-2]*neg[-3]
        elif m1==4:
            ans=pos[-1]*pos[-2]*pos[-3]*pos[-4]*neg[-1]
        print(ans)
    else:
        print(max)