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 _ in range(int(input())):
    n = int(input())
    data = list(map(int, input().split()))
  
    result = -1e21
    if 0 in data:
        result = 0
  
    negative_count = 0
    positive_count = 0
    positive_list = []
    negative_list = []
    for x in data:
        if x < 0:
            negative_list.append(x)
        elif x > 0:
            positive_list.append(x)
    
    data.sort()
    negative_list.sort()
    positive_list.sort()

    # Negative Count == 4
    if  len(negative_list) >= 4 and len(positive_list) >= 1:
        result = max(result, negative_list[0] * negative_list[1] * negative_list[2] * negative_list[3] * positive_list[-1])
    # Negative Count == 2
    if  len(negative_list) >= 2 and len(positive_list) >= 3:
        result = max(result, negative_list[0] * negative_list[1] * positive_list[-1] * positive_list[-2] * positive_list[-3])
    # Negative Count = 0
    if  len(negative_list) >= 0 and len(positive_list) >= 5:
        result = max(result, positive_list[-1] * positive_list[-2] * positive_list[-3] * positive_list[-4] * positive_list[-5])
    ''' Find small abstract '''
    # Negative Count == 1
    if len(negative_list) >= 1 and len(positive_list) >= 4:
      result = max(result, negative_list[-1] * positive_list[0] * positive_list[1] * positive_list[2] * positive_list[3])
    # Negative Count == 3
    if len(negative_list) >= 3 and len(positive_list) >= 2:
      result = max(result, negative_list[-1] * negative_list[-2] * negative_list[-3] * positive_list[0] * positive_list[1])
    # Negative Count == 5
    if len(negative_list) >= 5 and len(positive_list) >= 0:
      result = max(result, negative_list[-1] * negative_list[-2] * negative_list[-3] * negative_list[-4] * negative_list[-5])

    print(result)