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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Collections;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int t = in.nextInt();
            while (t-- > 0) {
                int n = in.nextInt();
                ArrayList<Long> pos = new ArrayList<>();
                ArrayList<Long> neg = new ArrayList<>();
                ArrayList<Long> zer = new ArrayList<>();
                for (int i = 0; i < n; i++) {
                    long val = in.nextLong();
                    if (val > 0)
                        pos.add(val);
                    else if (val == 0)
                        zer.add(val);
                    else
                        neg.add(val);
                }
                Collections.sort(pos, Collections.reverseOrder());
                Collections.sort(neg);
                long ans = Long.MIN_VALUE;
                if (zer.size() > 0)
                    ans = 0;
                long temp1 = Long.MIN_VALUE;
                if (neg.size() >= 2 && pos.size() >= 3) {
                    temp1 = neg.get(0) * neg.get(1) * pos.get(0) * pos.get(1) * pos.get(2);
                }
                ans = Math.max(temp1, ans);
                long temp2 = Long.MIN_VALUE;
                if (neg.size() >= 4 && pos.size() >= 1) {
                    temp2 = neg.get(0) * neg.get(1) * neg.get(2) * neg.get(3) * pos.get(0);
                }
                ans = Math.max(temp2, ans);
                long temp3 = Long.MIN_VALUE;
                if (pos.size() >= 5)
                    temp3 = pos.get(0) * pos.get(1) * pos.get(2) * pos.get(3) * pos.get(4);
                ans = Math.max(temp3, ans);
                if (ans >= 0) {
                    out.println(ans);
                    continue;
                }
                Collections.sort(neg, Collections.reverseOrder());
                Collections.sort(pos);
                long temp4 = Long.MIN_VALUE;
                if (neg.size() >= 1 && pos.size() >= 4) {
                    temp4 = neg.get(0) * pos.get(0) * pos.get(1) * pos.get(2) * pos.get(3);
                }
                ans = Math.max(temp4, ans);
                long temp5 = Long.MIN_VALUE;
                if (neg.size() >= 3 && pos.size() >= 2) {
                    temp5 = neg.get(0) * neg.get(1) * neg.get(2) * pos.get(0) * pos.get(1);
                }
                ans = Math.max(temp5, ans);
                long temp6 = Long.MIN_VALUE;
                if (neg.size() >= 5) {
                    temp6 = neg.get(0) * neg.get(1) * neg.get(2) * neg.get(3) * neg.get(4);
                }
                ans = Math.max(ans, temp6);
                out.println(ans);
            }
        }

    }
}

