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 i in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    a=sorted(a,key=abs,reverse=True)
    j=0
    q=1
    f=0
    for j in range(n):
        if a[j]>=0:
            f=1
            break
    if f==1:
        for j in range(5):
            q=q*a[j]
    else:
        for j in range(n-1,n-6,-1):
            q=q*a[j]
    if q>0 or n==5:
        print(q)
    elif f==0:
        print(q)
    else:
        k=0
        j=0
        v=1
        m=0
        while j<n :
            if a[j]<0 and k<2:
                k=k+1
                v=v*a[j]
            elif a[j]>=0 and m<3:
                v=v*a[j]
                m=m+1
            j=j+1
        if k==2 and m==3:
            q=max(q,v)
        k=0
        j=0
        v=1
        m=0
        while j<n and m<5:
            if a[j]>=0:
                v=v*a[j]
                m=m+1
            j=j+1
        if m==5:
            q=max(q,v)
        k=0
        j=0
        v=1
        m=0
        while j<n:
            if a[j]<0 and k<4:
                k=k+1
                v=v*a[j]
            elif a[j]>=0 and m<1:
                v=v*a[j]
                m=m+1
            j=j+1
        #print(v,k,m)
        if k==4 and m==1:
            q=max(q,v)
        print(q)
        
                
        