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.
//   package com.company.codeforces;


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.sql.SQLOutput;
import java.util.*;



public class Solution {

    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        int t=input.nextInt();
        while (t-->0) {
            res = Long.MIN_VALUE;
            int n = input.nextInt();
            int a[] = new int[n];
            ArrayList<Integer> pos = new ArrayList<>();
            ArrayList<Integer> neg = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int temp = input.nextInt();
                if (temp < 0) {
                    neg.add(temp);
                } else {
                    pos.add(temp);
                }
            }
            Collections.sort(pos, Collections.reverseOrder());
            Collections.sort(neg);
            ArrayList<Integer> arr = new ArrayList<>();

            if (pos.size() == 0) {
                for (int i = neg.size() - 1; i >= 0 && i>=n-5; i--) {
                    arr.add(neg.get(i));
                }
//                System.out.println(arr);
                go(-1, 5, arr, 1);
                System.out.println(res);
            } else {

                for (int i = 0; i < 5 && i < neg.size(); i++) {
                    arr.add(neg.get(i));
                }
                for (int i = 0; i < 5 && i < pos.size(); i++) {
                    arr.add(pos.get(i));
                }


                go(-1, 5, arr, 1);
                System.out.println(res);
            }
        }
    }
    static  long res=Long.MIN_VALUE;

    private static void go(int i, int k, ArrayList<Integer> arr, long pro) {
        if (k==0){
            res=Math.max(res,pro);
            return;
        }



        for (int j = i+1; j <arr.size() ; j++) {
            go(j, k-1, arr, pro*arr.get(j));

        }
    }
}