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())
    arr=list(map(int,input().split()))
    lis1=[]
    lis2=[]
    a=0
    b=0
    c=arr.count(0)
    for i in range(n):
        if arr[i]>0:
            lis1.append(arr[i])
            a+=1
        elif arr[i]<0:
            lis2.append(arr[i])
            b+=1
    lis1.sort()
    lis2.sort(reverse=True)
    if a+b<5:
        print(0)
    else:
        if a>=5:
            if b>=4:
                x=lis2[-1]*lis2[-2]*lis2[-3]*lis2[-4]*lis1[-1]
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                z=lis1[-5]*lis1[-4]*lis1[-1]*lis1[-2]*lis1[-3]
                print(max(x,y,z))
            elif b>=2:
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                z=lis1[-5]*lis1[-4]*lis1[-1]*lis1[-2]*lis1[-3]
                print(max(y,z))
            else:
                print(lis1[-5]*lis1[-4]*lis1[-1]*lis1[-2]*lis1[-3])
        elif a==4:
            if b>=4:
                x=lis2[-1]*lis2[-2]*lis2[-3]*lis2[-4]*lis1[-1]
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                print(max(x,y))
            elif b>=2:
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                print(y)
            else:
                if c>0:
                    print(0)
                else:
                    z=lis2[-1]*lis1[-4]*lis1[-1]*lis1[-2]*lis1[-3]
                    print(z)
        elif a==3:
            if b>=4:
                x=lis2[-1]*lis2[-2]*lis2[-3]*lis2[-4]*lis1[-1]
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                print(max(x,y))
            elif b>=2:
                y=lis2[-1]*lis2[-2]*lis1[-1]*lis1[-2]*lis1[-3]
                print(y)
        elif a==2:
            if b>=4:
                x=lis2[-1]*lis2[-2]*lis2[-3]*lis2[-4]*lis1[-1]
                print(x)
            elif b==3:
                if c>0:
                    print(0)
                else:
                    z=lis2[-1]*lis2[-2]*lis2[-3]*lis1[-2]*lis1[-1]
                    print(z)
        elif a==1:
            if b>=4:
                x=lis2[-1]*lis2[-2]*lis2[-3]*lis2[-4]*lis1[-1]
                print(x)
        else:
            if c>0:
                print(0)
            else:
                print(lis2[0]*lis2[1]*lis2[2]*lis2[3]*lis2[4])