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.Arrays;
import java.util.StringTokenizer;

public class CF1406B {
    static FastScanner fs;
    static PrintWriter out;
    
    public static void main(String[] args) {
        fs = new FastScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        
        int t = fs.nextInt();
        for(long tc=0; tc<t; tc++) {
            int n = fs.nextInt();
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = fs.nextLong();
            }
            Arrays.sort(a);
            int s = n-5, e = -1;
            long maxp = Long.MIN_VALUE, p;
            while(s < n) {
                p = 1;
                for (int i = s; i < n; i++) {
                    p *= a[i];
                }
                for (int i = 0; i <= e; i++) {
                    p *= a[i];
                }
                maxp = Math.max(maxp, p);
                s++;
                e++;
            }
            p = 1;
            for (int i = 0; i <= e; i++) {
                p *= a[i];
            }
            maxp = Math.max(maxp, p);
            out.println(maxp);
        }
        out.close();
    }
    
    private static class FastScanner {
        BufferedReader bf;
        StringTokenizer st;
        public FastScanner() {
            this.bf = new BufferedReader(new InputStreamReader(System.in));
            this.st = new StringTokenizer("");
        }
        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    this.st = new StringTokenizer(this.bf.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return this.st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(this.next());
        }
        
        public long nextLong() {
            return Long.parseLong(this.next());
        }
        
        public double nextDouble() {
            return Double.parseDouble(this.next());
        }
        
        public String nextLine() {
            String str = "";
            try {
                str = this.bf.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
