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 javax.sound.sampled.Line;
import java.io.*;
import java.util.*;

public class TaskB {
    public static void main(String[] args) throws Exception {
        Reader sc = new Reader();
        PrintWriter pw = new PrintWriter(System.out);
        
        try {
            int t = sc.nextInt();
            while(t-->0) {
                int n = sc.nextInt();
                PriorityQueue<Long> pos = new PriorityQueue<>(Collections.reverseOrder());
                PriorityQueue<Long> neg = new PriorityQueue<>();

                boolean zero = false;
                for(int i=0 ; i<n ; i++) {
                    long l = sc.nextLong();
                    if(l > 0) {
                        pos.add(l);
                    }
                    else if(l == 0) {
                        zero = true;
                    }
                    else {
                        neg.add(l);
                    }
                }

                if(pos.size() + neg.size() < 5) {
                    pw.println(0);
                }
                else {
                    long max = Long.MIN_VALUE;
                    LinkedList<Long> ll = new LinkedList<>();
                    if(pos.size() >= 5) {
                        long mul = 1;
                        for(int i=0 ; i<5 ; i++) {
                            long x = pos.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) pos.add(ll.poll());

                        max = Math.max(max, mul);
                    }

                    if(pos.size() >= 3 && neg.size() >= 2) {
                        long mul = 1;
                        for(int i=0 ; i<3 ; i++) {
                            long x = pos.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) pos.add(ll.poll());

                        for(int i=0 ; i<2 ; i++) {
                            long x = neg.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) neg.add(ll.poll());

                        max = Math.max(max, mul);
                    }

                    if(pos.size() >= 1 && neg.size() >= 4) {
                        long mul = 1;
                        for(int i=0 ; i<1 ; i++) {
                            long x = pos.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) pos.add(ll.poll());

                        for(int i=0 ; i<4 ; i++) {
                            long x = neg.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) neg.add(ll.poll());

                        max = Math.max(max, mul);
                    }

                    if(zero) {
                        max = Math.max(max, 0);
                    }

                    if(pos.size() == 4 && neg.size() == 1) {
                        long mul = 1;
                        for(int i=0 ; i<4 ; i++) {
                            long x = pos.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) pos.add(ll.poll());

                        for(int i=0 ; i<1 ; i++) {
                            long x = neg.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) neg.add(ll.poll());

                        max = Math.max(max, mul);
                    }

                    if(pos.size() == 2 && neg.size() == 3) {
                        long mul = 1;
                        for(int i=0 ; i<2 ; i++) {
                            long x = pos.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) pos.add(ll.poll());

                        for(int i=0 ; i<3 ; i++) {
                            long x = neg.poll();
                            mul *= x;
                            ll.add(x);
                        }

                        while(!ll.isEmpty()) neg.add(ll.poll());

                        max = Math.max(max, mul);
                    }

                    if(pos.size() == 0) {
                        while(neg.size() != 5) {
                            neg.poll();
                        }

                        long mul = 1;
                        while(neg.size() != 0) {
                            mul *= neg.poll();
                        }

                        max = Math.max(max, mul);
                    }

                    pw.println(max);
                }
            }
        }
        finally {
            pw.flush();
            pw.close();
        }
    }
    
    static class Reader {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while(!st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch(IOException io) {
                    io.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}
