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.
# cook your dish here
t = int(input())

while t:
    n = int(input())
    a = [int(i) for i in input().split()]
    pos = []
    neg = []
    
    for ele in a:
        if ele>0:
            pos.append(ele)
        else:
            neg.append(ele)
            
    pos.sort()
    neg.sort()
    
    if len(pos) == 0:
        ans = 1
        for i in range(1,6):
            ans*=neg[-i]
        print(ans)
    
    elif len(neg) == 0:
        ans = 1
        for i in range(1,6):
            ans*=pos[-i]
        print(ans)
        
    else:
        ans = float('-inf')
        for i in range(1,6):
            if len(pos)<i or len(neg)<5-i:
                continue
            temp= 1
            for j in range(1,i+1):
                temp*=pos[-j]
            if (5-i)%2 == 0:
                for j in range(5-i):
                    temp*=neg[j]
            else:
                for j in range(1,5-i+1):
                    temp*=neg[-j]
            ans = max(ans,temp)
        print(ans)
            
    
    t-=1