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.
testcase = int(input())

for _ in range(testcase):
    n = int(input())
    a = list(map(int, input().split()))
    a.sort(reverse=True)
    k = 5

    pos = []
    neg  = []
    pool = []
    zeros = 0
    for i in range(n):
        if a[i]>0:
            pos.append(a[i])
        if a[i]<0:
            neg.append(a[i])
        if a[i]==0:
            zeros+=1
    pos.sort()
    neg.sort(reverse=True)
    ans = []
    if len(pos)==0:
        if len(neg)<k or (zeros>0 and k%2):
            ans = [0]
        else:
            if(k%2):
                for i in range(k):
                    ans.append(neg[i])
            else:
                for i in range(k):
                    ans.append(neg[-i-1])
        k = 0
    elif len(pos)+len(neg)<k:
        ans = [0]
    else:
        if k%2== 1:
            ans.append(pos[-1])
            pos.pop()
            k-=1
        while(k):
            if len(pos)<2 and len(neg)<2:
                if zeros>0:
                    ans = [0]
                    k = 0
                else:
                    ans.append(pos[0])
                    ans.append(neg[0])
                    k -= 2
                break
            elif len(pos)<2:
                ans.append(neg[-1])
                ans.append(neg[-2])
                neg.pop()
                neg.pop()
            elif len(neg)<2:
                ans.append(pos[-1])
                ans.append(pos[-2])
                pos.pop()
                pos.pop()
            else:
                if neg[-1]*neg[-2] >= pos[-1]*pos[-2]:
                    ans.append(neg[-1])
                    ans.append(neg[-2])
                    neg.pop()
                    neg.pop()   
                else:
                    ans.append(pos[-1])
                    ans.append(pos[-2])
                    pos.pop()
                    pos.pop()
            k -= 2



    res = 1
    for i in range(len(ans)):
        res *= ans[i]

    print(res)