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.util.*;
import java.io.*;
 
public class B {
    static class Pair {
        int a, b;

        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        public String toString() {
            return "(" + a + ", " + b + ")";
        }
    }
    public static void main(String[] args) throws IOException {
        FastScanner input = new FastScanner(System.in);
        // Scanner input = new Scanner(new File("input.txt"));
        PrintWriter output = new PrintWriter(System.out);

        int t = input.nextInt();
        for (int q = 0; q < t; q++) {
            int n = input.nextInt();
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = input.nextLong();
            }
            Arrays.sort(a);

            long a1 = a[0] * a[1] * a[2] * a[3] * a[4];
            long a2 = a[0] * a[1] * a[2] * a[3] * a[n - 1];
            long a3 = a[0] * a[1] * a[2] * a[n - 2] * a[n - 1];
            long a4 = a[0] * a[1] * a[n - 3] * a[n - 2] * a[n - 1];
            long a5 = a[0] * a[n - 4] * a[n - 3] * a[n - 2] * a[n - 1];
            long a6 = a[n - 5] * a[n - 4] * a[n - 3] * a[n - 2] * a[n - 1];

            long ans = Math.max(a1, a2);
            ans = Math.max(ans, a3);
            ans = Math.max(ans, a4);
            ans = Math.max(ans, a5);
            ans = Math.max(ans, a6);

            output.println(ans);
        }        

        output.close();
    }
 
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
 
        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }
 
        FastScanner(FileReader s) {
            br = new BufferedReader(s);
        }
 
        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
 
        String nextLine() throws IOException {
            return br.readLine();
        }
 
        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
 
        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
 
        long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}
