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.
t = int(input())
for _ in range(t):
    n = int(input())
    a = list(map(int, input().split()))
    
    m = []
    p = []
    cnt0 = 0
    for val in a:
        if val > 0:
            p.append(val)
        elif val < 0:
            m.append(val)
        else:
            cnt0 += 1
    p = sorted(p, reverse=True)
    m = sorted(m)
    
    # ppppp
    ans = -10 ** 20
    tmp = 1
    if len(p) >= 5:
        for i in range(5):
            tmp *= p[i]
        ans = max(tmp, ans)
    # ppppm
    tmp = 1
    if len(p) >= 4 and len(m) >= 1:
        for i in range(4):
            tmp *= p[~i]
        for i in range(1):
            tmp *= m[~i]
        ans = max(tmp, ans)
    # pppmm
    tmp = 1
    if len(p) >= 3 and len(m) >= 2:
        for i in range(3):
            tmp *= p[i]
        for i in range(2):
            tmp *= m[i]
        ans = max(tmp, ans)
    # ppmmm
    tmp = 1
    if len(p) >= 2 and len(m) >= 3:
        for i in range(2):
            tmp *= p[~i]
        for i in range(3):
            tmp *= m[~i]
        ans = max(tmp, ans)
    # pmmmm
    tmp = 1
    if len(p) >= 1 and len(m) >= 4:
        for i in range(1):
            tmp *= p[i]
        for i in range(4):
            tmp *= m[i]
        ans = max(tmp, ans)
    # mmmmm
    tmp = 1
    if len(m) >= 5:
        for i in range(5):
            tmp *= m[~i]
        ans = max(tmp, ans)
    if cnt0 > 0:
        ans = max(0, ans)

    print(ans)