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 i in range(t):
    n = int(input())
    a = list(map(int,input().split()))
    pos = []
    neg = []
    zero = 0
    for j in range(n):
        if a[j] > 0:
            pos.append(a[j])
        elif a[j] < 0:
            neg.append(-a[j])
        else:
            zero += 1
    pos.sort()
    neg.sort()
    if len(a) == 5 and zero == 0 and len(pos) in [0, 2, 4]:
        ans = 1
        for j in range(5):
            ans *= a[j]
    elif not pos and not zero:
        ans = -1
        for j in range(5):
            ans *= neg[j]
    else:
        posone,posthree,posfive = 0,0,0
        if len(pos) >= 5:
            posfive = 1
            for j in range(1,6):
                posfive *= pos[-j]
        if len(pos) >= 3 and len(neg) >= 2:
            posthree = 1
            for j in range(1,4):
                posthree *= pos[-j]
            for j in range(1,3):
                posthree *= neg[-j]
        if len(pos) >= 1 and len(neg) >= 4:
            posone = pos[-1]
            for j in range(1,5):
                posone *= neg[-j]
        ans = max(posone,posthree,posfive)
    print(ans)