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.

/*
    Modassir_Ali
    algo.java
*/
import java.util.*;
import java.io.*;
import java.util.Stack;
import java.util.HashSet;
import java.util.HashMap;

public class B_CF670D2 {
    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;
        }
    }

    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static int ni() throws IOException {
        return sc.nextInt();
    }

    static long nl() throws IOException {
        return sc.nextLong();
    }

    static int[][] nai2(int n, int m) throws IOException {
        int a[][] = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                a[i][j] = ni();
        return a;
    }

    static int[] nai(int N, int start) throws IOException {
        int[] A = new int[N + start];
        for (int i = start; i != (N + start); i++) {
            A[i] = ni();
        }
        return A;
    }

    static Integer[] naI(int N, int start) throws IOException {
        Integer[] A = new Integer[N + start];
        for (int i = start; i != (N + start); i++) {
            A[i] = ni();
        }
        return A;
    }

    static long[] nal(int N) throws IOException {
        long[] A = new long[N];
        for (int i = 0; i != N; i++) {
            A[i] = nl();
        }
        return A;
    }

    static void print(int arr[]) {
        for (int i = 0; i < arr.length; i++)
            out.print(arr[i] + " ");
        out.println();
    }

    static void print(long arr[]) {
        for (int i = 0; i < arr.length; i++)
            out.print(arr[i] + " ");
        out.println();
    }

    static long gcd(long a, long b) throws IOException {
        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) throws IOException {
        return (b == 0) ? a : gcd(b, a % b);
    }

    static int bit(long n) throws IOException {
        return (n == 0) ? 0 : (1 + bit(n & (n - 1)));
    } // return the number of set bits.

    static boolean isPrime(int number) {
        if (number == 1)
            return false;
        if (number == 2 || number == 3) {
            return true;
        }
        if (number % 2 == 0) {
            return false;
        }
        int sqrt = (int) Math.sqrt(number) + 1;
        for (int i = 3; i < sqrt; i += 2) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }

    static boolean isPrime(long number) {
        if (number == 1)
            return false;
        if (number == 2 || number == 3) {
            return true;
        }
        if (number % 2 == 0) {
            return false;
        }
        long sqrt = (long) Math.sqrt(number) + 1;
        for (int i = 3; i < sqrt; i += 2) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }

    static int power(int n, int p) {
        if (p == 0)
            return 1;
        int a = power(n, p / 2);
        a = a * a;
        int b = p & 1;
        if (b != 0) {
            a = n * a;
        }
        return a;
    }

    static long power(long n, long p) {
        if (p == 0)
            return 1;
        long a = power(n, p / 2);
        a = a * a;
        long b = p & 1;
        if (b != 0) {
            a = n * a;
        }
        return a;
    }

    static void reverse(int[] a) {
        int b;
        for (int i = 0, j = a.length - 1; i < j; i++, j--) {
            b = a[i];
            a[i] = a[j];
            a[j] = b;
        }
    }

    static void reverse(long[] a) {
        long b;
        for (int i = 0, j = a.length - 1; i < j; i++, j--) {
            b = a[i];
            a[i] = a[j];
            a[j] = b;
        }
    }

    static void swap(int a[], int i, int j) {
        a[i] = a[i] ^ a[j];
        a[j] = a[j] ^ a[i];
        a[i] = a[i] ^ a[j];
    }

    static void swap(long a[], int i, int j) {
        a[i] = a[i] ^ a[j];
        a[j] = a[j] ^ a[i];
        a[i] = a[i] ^ a[j];
    }

    static int count(int n) {
        int c = 0;
        while (n > 0) {
            c++;
            n = n / 10;
        }
        return c;
    }

    static int[] prefix_sum(int a[], int n) {
        int s[] = new int[n];
        s[0] = a[0];
        for (int i = 1; i < n; i++) {
            s[i] = a[i] + s[i - 1];
        }
        return s;
    }

    static long[] prefix_sum_int(int a[], int n) {
        long s[] = new long[n];
        s[0] = (long) a[0];
        for (int i = 1; i < n; i++) {
            s[i] = ((long) a[i]) + s[i - 1];
        }
        return s;
    }

    static long[] prefix_sum_Integer(Integer a[], int n) {
        long s[] = new long[n];
        s[0] = (long) a[0];
        for (int i = 1; i < n; i++) {
            s[i] = ((long) a[i]) + s[i - 1];
        }
        return s;
    }

    static long[] prefix_sum_long(long a[], int n) {
        long s[] = new long[n];
        s[0] = a[0];
        for (int i = 1; i < n; i++) {
            s[i] = a[i] + s[i - 1];
        }
        return s;
    }

    static boolean isPerfectSquare(double x) {
        double sr = Math.sqrt(x);
        return ((sr - Math.floor(sr)) == 0);
    }

    static ArrayList<Integer> sieve(int n) {
        int k = 0;
        boolean prime[] = new boolean[n + 1];
        ArrayList<Integer> p_arr = new ArrayList<>();
        for (int i = 0; i < n; i++)
            prime[i] = true;
        for (int p = 2; p * p <= n; p++) {
            k = p;
            if (prime[p] == true) {
                p_arr.add(p);
                for (int i = p * 2; i <= n; i += p)
                    prime[i] = false;
            }
        }
        for (int i = k + 1; i <= n; i++) {
            if (prime[i] == true)
                p_arr.add(i);
        }
        return p_arr;
    }

    static boolean[] seive_check(int n) {
        boolean prime[] = new boolean[n + 1];
        for (int i = 0; i < n; i++)
            prime[i] = true;
        for (int p = 2; p * p <= n; p++) {
            if (prime[p] == true) {
                for (int i = p * 2; i <= n; i += p)
                    prime[i] = false;
            }
        }
        prime[1] = false;
        return prime;
    }

    static int get_bits(int n) {
        int p = 0;
        while (n > 0) {
            p++;
            n = n >> 1;
        }
        return p;
    }

    static int get_bits(long n) {
        int p = 0;
        while (n > 0) {
            p++;
            n = n >> 1;
        }
        return p;
    }

    static int get_2_power(int n) {
        if ((n & (n - 1)) == 0)
            return get_bits(n) - 1;
        return -1;
    }

    static int get_2_power(long n) {
        if ((n & (n - 1)) == 0)
            return get_bits(n) - 1;
        return -1;
    }

    static void close() {
        out.flush();
    }

    /*-------------------------Main Code Starts(algo.java)----------------------------------*/
    public static void main(String[] args) throws IOException {
        int t = ni();
        while (t-- != 0) {
            int n = ni();
            int arr[] = nai(n, 0);
            System.out.println(maxProductSubarrayOfSizeK(arr, n, 5));
        }
    }

    static long maxProductSubarrayOfSizeK(int A[], int n, int k) {
        Arrays.sort(A);
        long product = 1;

        if (A[n - 1] == 0 && k % 2 != 0)
            return 0;
        if (A[n - 1] <= 0 && k % 2 != 0) {
            for (int i = n - 1; i >= n - k; i--)
                product *= A[i];
            return product;
        }

        int i = 0;
        int j = n - 1;
        if (k % 2 != 0) {
            product *= A[j];
            j--;
            k--;
        }
        k >>= 1;

        for (int itr = 0; itr < k; itr++) {

            long left_product = A[i] * A[i + 1];

            long right_product = A[j] * A[j - 1];

            if (left_product > right_product) {
                product *= left_product;
                i += 2;
            } else {
                product *= right_product;
                j -= 2;
            }
        }

        return product;
    }

}
