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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    final int INF = 0x3f3f3f3f;
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;

    public Main() {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }

    public static void main(String[] args) {
        new Main();
    }

    private void solve() {
        int t = nextInt();
        while (t-- > 0) {
            int len = nextInt();
            int[] num = nextIntArr(len);
            int[] b0 = Arrays.stream(num).filter(x -> x > 0).sorted().toArray();
            int[] l0 = Arrays.stream(num).filter(x -> x <= 0).sorted().toArray();
            long ans = Long.MIN_VALUE;
            if (b0.length == 0 && l0.length >= 5) {
                ans = Math.max(ans, (long) l0[l0.length - 1] * l0[l0.length - 2] * l0[l0.length - 3] * l0[l0.length - 4] * l0[l0.length - 5]);
            }
            if (b0.length >= 1 && l0.length >= 4) {
                ans = Math.max(ans, (long) b0[b0.length - 1] * l0[0] * l0[1] * l0[2] * l0[3]);
            }
            if (b0.length >= 2 && l0.length >= 3) {
                ans = Math.max(ans, (long) b0[0] * b0[1] * l0[l0.length - 1] * l0[l0.length - 2] * l0[l0.length - 3]);
            }
            if (b0.length >= 3 && l0.length >= 2) {
                ans = Math.max(ans, (long) b0[b0.length - 1] * b0[b0.length - 2] * b0[b0.length - 3] * l0[0] * l0[1]);
            }
            if (b0.length >= 4 && l0.length >= 1) {
                ans = Math.max(ans, (long) b0[0] * b0[1] * b0[2] * b0[3] * l0[l0.length - 1]);
            }
            if (b0.length >= 5) {
                ans = Math.max(ans, (long) b0[b0.length - 1] * b0[b0.length - 2] * b0[b0.length - 3] * b0[b0.length - 4] * b0[b0.length - 5]);
            }
            outln(ans);
        }
    }


    private void outln(Object o) {
        out.println(o);
    }

    private void out(Object o) {
        out.print(o);
    }

    public long[] nextLongArr(int n) {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nextLong();
        }
        return res;
    }

    public int[] nextIntArr(int n) {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = nextInt();
        }
        return res;
    }

    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }

    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }

    public int nextInt() {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() {
        return Double.parseDouble(nextToken());
    }


}