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 ad in range(int(input())):
    n=int(input())
    l=list(map(int,input().split()))
    l.sort()

    pos=[];neg=[]
    for i in l:
        if i>=0:
            pos.append(i)
        else:
            neg.append(i)
    c=1
    '''i=0;j=n-1
    c*=max(l[i]*l[i+1],l[j]*l[j-1])
    if l[i]*l[i+1]>=l[j]*l[j-1]:
        i+=2
    else:
        j+=2
    c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
    if l[i] * l[i + 1] >= l[j] * l[j - 1]:
        i += 2
    else:
        j += 2
    d=c*max(l[i:j+1])'''
    if len(pos)==0:
        neg.sort();neg.reverse()
        ans=1
        for i in range(5):
            ans*=(neg[i])
    elif len(pos)==1 or len(pos)==3:
        i = 0;
        j = n - 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        d = c *l[-1]
        ans=d
    elif len(pos)==2 or len(pos)==4:
        i = 0;
        j = n - 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        d = c * l[-1]
        ans = d
    else:
        i = 0;
        j = n - 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        c *= max(l[i] * l[i + 1], l[j] * l[j - 1])
        if l[i] * l[i + 1] >= l[j] * l[j - 1]:
            i += 2
        else:
            j -= 2
        d = c * l[-1]
        ans = d
    print(ans)
