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 Solution {
    public static int cycles = 0;

    public static int[] nextArray(FastReader sc1, int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc1.nextInt();
        }
        return arr;
    }

    public static void printMatrix(int[][] mat) {
        for (int i = 0; i < mat.length; i++) {
            for (int j = 0; j < mat[0].length; j++) {
                System.out.print(mat[i][j] + " ");
            }
            System.out.println();
        }
        System.out.println();
    }

    public static void dfs(int node, HashMap<Integer, HashSet<Integer>> tree, int[] vis, int[] dist) {
        vis[node] = 1;
        if (tree.containsKey(node)) {
            HashSet<Integer> set = tree.get(node);
            for (int ele : set) {
                if (vis[ele] == 0) {
                    dist[ele] = dist[node] + 1;
                    dfs(ele, tree, vis, dist);
                }
            }
        }
    }

    public static void addEdge(int u, int v, HashMap<Integer, HashSet<Integer>> tree) {
        if (tree.containsKey(u)) {
            HashSet<Integer> set = tree.get(u);
            set.add(v);
            tree.put(u, set);
        } else {
            HashSet<Integer> set = new HashSet<>();
            set.add(v);
            tree.put(u, set);
        }
    }

    public static int gcdf(int a, int b) {
        if (a == 0)
            return b;

        return gcdf(b % a, a);
    }

    public static int[][] dp = new int[510][510];

    public static int compute(int l, int r, int[] arr){
        int[] fre = new int[101];
        int cval = 0;
        for(int i=l; i<=r; i++){
            fre[arr[i]]++;
            while(fre[cval] > 0){
                cval++;
            }
        }
        return cval;
    }

    public static void main(String[] args) {
        FastReader sc1 = new FastReader();
        StringBuilder sb = new StringBuilder();

        int tc = sc1.nextInt();
        int ch = 0;
        

        while(ch<tc){
            int n = sc1.nextInt();
            int[] arr = nextArray(sc1, n);
            
            ArrayList<Integer> pos = new ArrayList<>();
            ArrayList<Integer> neg = new ArrayList<>();
            long prod = 1L;

            for(int i=0; i<n; i++){
                if(arr[i] >= 0){
                    pos.add(arr[i]);
                }
                else{
                    neg.add(arr[i]);
                }
            }

            Collections.sort(pos);
            Collections.sort(neg);

            if(n == 5){
                for(int i=0; i<n; i++){
                    prod *= (long)arr[i];
                }
                sb.append(prod+"\n");
            }
            else{
                long rprod = (long)Long.MIN_VALUE;
                
                if(pos.size() == 0){
                    long ele1 = neg.get(neg.size()-1);
                    long ele2 = neg.get(neg.size()-2);
                    long ele3 = neg.get(neg.size()-3);
                    long ele4 = neg.get(neg.size()-4);
                    long ele5 = neg.get(neg.size()-5);
                    long cprod = ele1 * ele2 * ele3 * ele4 * ele5;
                    rprod = Math.max(rprod, cprod);
                }
                if(pos.size() >= 1 && neg.size() >= 4){
                    long ele1 = pos.get(pos.size()-1);
                    long ele2 = neg.get(0);
                    long ele3 = neg.get(1);
                    long ele4 = neg.get(2);
                    long ele5 = neg.get(3);
                    long cprod = ele1 * ele2 * ele3 * ele4 * ele5;
                    rprod = Math.max(rprod, cprod);
                }
                if(pos.size() >= 3 && neg.size() >= 2){
                    long ele1 = pos.get(pos.size()-1);
                    long ele2 = pos.get(pos.size()-2);
                    long ele3 = pos.get(pos.size()-3);
                    long ele4 = neg.get(0);
                    long ele5 = neg.get(1);
                    long cprod = ele1 * ele2 * ele3 * ele4 * ele5;
                    rprod = Math.max(rprod, cprod);
                }
                if(pos.size() >= 5){
                    long ele1 = pos.get(pos.size()-1);
                    long ele2 = pos.get(pos.size()-2);
                    long ele3 = pos.get(pos.size()-3);
                    long ele4 = pos.get(pos.size()-4);
                    long ele5 = pos.get(pos.size()-5);
                    long cprod = ele1 * ele2 * ele3 * ele4 * ele5;
                    rprod = Math.max(rprod, cprod);
                }
                sb.append(rprod+"\n");
            }
            ch++;
        }

        System.out.print(sb.toString());
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}