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())
    lis = list(map(int,input().split()))
    zer=0
    pos=[]
    neg=[]
    for i in lis:
        if i==0:
            zer+=1
        elif i>0:
            pos.append(i)
        else:
            neg.append(i)
    if len(pos)+len(neg)<5:
        print(0)
    else:
        pos.sort(reverse = True)
        neg.sort(reverse = True)
        ans=-1000000000000000000000000
        #print(pos,neg)
        tmp=1
        if len(pos)>=5:
            for i in range(5):
                tmp*=pos[i]
            ans=tmp
        if len(pos)>=4 and len(neg)>=1:
            tmp=1
            for i in range(4):
                tmp*=pos[i]
            tmp*=neg[0]
            ans=max(ans,tmp)
        if len(pos)>=3 and len(neg)>=2:
            tmp=1
            for i in range(3):
                tmp*=pos[i]
            tmp*=neg[-1]*neg[-2]
            ans = max(ans,tmp)
        if len(pos)>=2 and len(neg)>=3:
            tmp=1
            tmp=pos[0]*pos[1]*neg[0]*neg[1]*neg[2]
            ans=max(ans,tmp)
        if len(pos)>=1 and len(neg)>=4:
            tmp=pos[0]*neg[-4]*neg[-1]*neg[-2]*neg[-3]
            ans=max(ans,tmp)
        if len(neg)>=5:
            tmp=neg[0]*neg[1]*neg[2]*neg[3]*neg[4]
            ans=max(ans,tmp)
        if zer:
            ans=max(ans,0)
        print(ans)


