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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;     // System.out is a PrintWriter
import java.util.Arrays;
// import java.util.ArrayList;
// import java.util.Collections;    //  for ArrayList sorting mainly
// import java.util.HashMap;
// import java.util.HashSet;
import java.util.Random;
import java.util.StringTokenizer;

public class B {
    public static void main(String[] args) throws Exception {
        FastScanner scn = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int tc = scn.nextInt();
        while (tc-- > 0) {
            int N = scn.nextInt();
            if (N == 5) {
                long ans = 1L;
                while (N-- > 0) {
                    ans *= scn.nextLong();
                }
                out.println(ans);
            } else {
                long[] arr = new long[N];
                for (int i = 0; i < N; i++) {
                    arr[i] = scn.nextLong();
                }
                Arrays.sort(arr);
                long last = arr[N - 1] * arr[N - 2] * arr[N - 3] * arr[N - 4] * arr[N - 5] * 1L;
                long first = arr[N - 1] * arr[N - 2] * arr[N - 3] * arr[1] * arr[0] * 1L;
                long midLike = arr[N - 1] * arr[3] * arr[2] * arr[1] * arr[0] * 1L;
                out.println(Math.max(last, Math.max(first, midLike)));
            }
        }
        out.close();
    }

    static class Pair implements Comparable<Pair> {
        int ff, ss; // default 0 --> first and second
        
        public Pair(int first, int second) {
            this.ff = first;
            this.ss = second;
        }

        @Override
        public int compareTo(Pair o) {
            if (ff != o.ff)
                return ff - o.ff;
            return ss - o.ss;
        }

        @Override
        public String toString() {
            return "[" + ff + ", " + ss + "]";
        }
    }

    static final Random random = new Random();

    static void ruffleSort(int[] arr) {
        for (int i = 0, N = arr.length; i < N; i++) {
            int randIdx = random.nextInt(N);
            // swap
            int temp = arr[randIdx];
            arr[randIdx] = arr[i];
            arr[i] = temp;
        }
        Arrays.sort(arr); // NOTE use quick-sort for primitive types, merge-sort for objects implementing Comparable/Comparator
    }
    
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        FastScanner() {
            this.br = new BufferedReader(new InputStreamReader(System.in));
            this.st = new StringTokenizer("");
        }
        FastScanner(String file) {
            try {
                java.io.File inpFile = new java.io.File(file);
                this.br = new BufferedReader(new java.io.FileReader(inpFile));
            } catch (FileNotFoundException err) {
                err.printStackTrace();
            }
            this.st = new StringTokenizer("");
        }

        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException err) {
                    err.printStackTrace();
                }
            return st.nextToken();
        }

        String nextLine() {
            if (st.hasMoreTokens()) {
                return st.nextToken("").trim();
            }
            try {
                return br.readLine().trim();
            } catch (IOException err) {
                err.printStackTrace();
            }
            return "";
        }

        byte nextByte() {
            return Byte.parseByte(next());
        }

        short nextShort() {
            return Short.parseShort(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        float nextFloat() {
            return Float.parseFloat(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        int[] readIntArray(final int N) {
            int[] arr = new int[N];
            for (int i = 0; i < N; i++)
                arr[i] = nextInt();
            return arr;
        }
    }
}
