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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;

public class B {

	public static void main(String[] args) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int numOfTests = Integer.parseInt(br.readLine());

		for (int test = 0; test < numOfTests; test++) {

			StringTokenizer st = new StringTokenizer(br.readLine(), " ");

			int n = Integer.parseInt(st.nextToken());

			List<Long> positive = new ArrayList<Long>();
			List<Long> negative = new ArrayList<Long>();

			st = new StringTokenizer(br.readLine(), " ");

			long res = 1;

			for (int i = 0; i < n; i++) {
				long a = Long.parseLong(st.nextToken());

				if (i < 5) {
					res *= a;
				}

				if (a < 0) {
					negative.add(a);
				} else if (a > 0) {
					positive.add(a);
				}
			}

			if (negative.size() + positive.size() >= 5) {

				Collections.sort(negative);
				Collections.sort(positive);

				for (int i = 0; i <= Math.min(5, positive.size()); i++) {

					int j = 5 - i;

					if (j <= negative.size()) {
						
						long temp = 1;
						

						if (j % 2 == 1) {
							for (int k = negative.size() - 1; k >= negative.size() - j; k--) {
								temp *= negative.get(k);
							}
							
							for(int k=0; k<i; k++) {
								temp *= positive.get(k);
							}
						} else {
							for (int k = 0; k < j; k++) {
								temp *= negative.get(k);
							}
							
							for (int k = positive.size() - 1; k >= positive.size() - i; k--) {
								temp *= positive.get(k);
							}
						}

						res = Math.max(res, temp);
					}
				}
				
				if (negative.size() + positive.size() < n) {
					res = Math.max(res, 0);
				}
				
				System.out.println(res);
			} else {
				System.out.println(0);
			}
		}

	}
}