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.*;

public class Main{
    public static void main(String[] args){
        InputReader in = new InputReader(System.in);
        int t = in.nextInt();
        while(t-- > 0){
            int n = in.nextInt();
            Long[] a = new Long[n];
            for(int i = 0; i < n; i++)
                a[i] = in.nextLong();
            Arrays.sort(a);
            solve(a);
        }
    }
    static void solve(Long[] a){
        long ans = Long.MIN_VALUE;
        long sum = 0;
        sum += a[0]*a[1]*a[2]*a[3]*a[4];
        ans = sum;
        sum = 0;
        sum += a[0]*a[1]*a[2]*a[3]*a[a.length-1];
        if(ans < sum){
            ans = sum;
        }
        sum = 0;
        sum += a[0]*a[1]*a[2]*a[a.length-2]*a[a.length-1];
        if(ans < sum){
            ans = sum;
        }
        sum = 0;
        sum += a[0]*a[1]*a[a.length-3]*a[a.length-2]*a[a.length-1];
        if(ans < sum){
            ans = sum;
        }
        sum = 0;
        sum += a[0]*a[a.length-1]*a[a.length-2]*a[a.length-3]*a[a.length-4];
        if(ans < sum){
            ans = sum;
        }
        sum = 0;
        sum += a[a.length-5]*a[a.length-1]*a[a.length-2]*a[a.length-3]*a[a.length-4];
        if(ans < sum){
            ans = sum;
        }
        System.out.println(ans);
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
 
    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }
 
    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
 
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    long nextLong() 
    { 
        return Long.parseLong(next()); 
    } 
  
    double nextDouble() 
    { 
        return Double.parseDouble(next()); 
    } 
  
    String nextLine() 
    { 
        String str = ""; 
        try
        { 
            str = reader.readLine(); 
        } 
        catch (IOException e) 
        { 
            e.printStackTrace(); 
        } 
        return str; 
    } 
 
}