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.
import java.io.*;
import java.util.*;

public class B {
    public static void main(String[] args) throws Exception {
        BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
        int t = Integer.parseInt(buffer.readLine());
        while (t-- > 0) {
            int n = Integer.parseInt(buffer.readLine());
            String[] inp = buffer.readLine().split(" ");
            long[] arr = new long[n];
            int posCnt = 0, negCnt = 0;
            for (int pos = 0; pos < n; pos++) {
                arr[pos] = Integer.parseInt(inp[pos]);
                if (arr[pos] > 0) posCnt++;
                else negCnt++;
            }
            long pro;
            long ans = 1;
            if (n == 5) {
                for (int pos = 0; pos < n; pos++) {
                    ans *= arr[pos];
                }
                sb.append(ans).append("\n");
                continue;
            }
            Arrays.sort(arr);
            for (int i = arr.length - 1; i >= arr.length - 5; i--) {
                ans *= arr[i];
            }
            pro = ans;
            int cnt = 0, left = 0, right = n - 1;
            if (negCnt >= 2 && posCnt >= 3){
                ans = arr[0]*arr[1]*arr[n-1]*arr[n-2]*arr[n-3];
                pro = Math.max(pro, ans);
            }
            if (negCnt >= 4 && posCnt >= 1){
                ans = arr[n-1]*arr[0]*arr[1]*arr[2]*arr[3];
                pro = Math.max(pro, ans);
            }
            sb.append(pro).append("\n");
        }
        System.out.println(sb);
    }
}