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

    ans = -10**100

    if n == 5:
        ans = l[0]*l[1]*l[2]*l[3]*l[4]

    elif n == 6:
        if 0 not in l:
            prod = l[0]*l[1]*l[2]*l[3]*l[4]*l[5]
            ans = max(prod/l[0], prod/l[1], prod/l[2], prod/l[3], prod/l[4], prod/l[5])

    elif n == 7:
        if 0 not in l:
            prod = l[0]*l[1]*l[2]*l[3]*l[4]*l[5]*l[6]
            ans = max(prod/l[0]/l[1], prod/l[0]/l[2], prod/l[0]/l[3], prod/l[0]/l[4], prod/l[0]/l[5], prod/l[0]/l[6],
                      prod/l[1]/l[2], prod/l[1]/l[3], prod/l[1]/l[4], prod/l[1]/l[5], prod/l[1]/l[6],
                      prod/l[2]/l[3], prod/l[2]/l[4], prod/l[2]/l[5], prod/l[2]/l[6],
                      prod/l[3]/l[4], prod/l[3]/l[5], prod/l[3]/l[6],
                      prod/l[4]/l[5], prod/l[4]/l[6],
                      prod/l[5]/l[6])

    mp = []
    mn = []

    for i in l:
        if i > 0:
                mp.append(i)
        if i < 0:
                mn.append(i)

    if 0 in l: ans = 0
    
    mp = list(sorted(mp))
    mn = list(sorted(mn))
    
    if len(mp) >= 5:
        ans = max(ans, mp[-1]*mp[-2]*mp[-3]*mp[-4]*mp[-5])
    if len(mp) >= 3 and len(mn) >= 2:
        ans = max(ans, mp[-1]*mp[-2]*mp[-3]*mn[0]*mn[1])
    if len(mp) >= 1 and len(mn) >= 4:
        ans = max(ans, mp[-1]*mn[0]*mn[1]*mn[2]*mn[3])
    if len(mp) == 0 and len(mn) >= 5:
        ans = max(ans, mn[-1]*mn[-2]*mn[-3]*mn[-4]*mn[-5])

    print(int(ans))
