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.
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


def solve():
    n = Scanner.int()
    a = Scanner.map_int()
    A,  C = [],  []
    zero = False
    for i in a:
        if i < 0:
            A.append(i)
        elif i == 0:
            zero = True
        else:
            C.append(i)
    A.sort()
    C.sort(reverse=True)
    ans = -1000000000000000000
    if len(A) >= 5:
        ans = max(ans, A[-1] * A[-2] * A[-3] * A[-4] * A[-5])
    if len(A) >= 4 and len(C) >= 1:
        ans = max(ans, A[0] * A[1] * A[2] * A[3] * C[0])
    if len(A) >= 3 and len(C) >= 2:
        ans = max(ans, A[-1] * A[-2] * A[-3] * C[0] * C[1])
    if len(A) >= 2 and len(C) >= 3:
        ans = max(ans, A[0] * A[1] * C[0] * C[1] * C[2])
    if len(A) >= 1 and len(C) >= 4:
        ans = max(ans, A[-1] * C[0] * C[1] * C[2] * C[3])
    if len(C) >= 5:
        ans = max(ans, C[0] * C[1] * C[2] * C[3] * C[4])
    if ans < 0 and zero:
        ans = 0
    print(ans)


def main():
    # sys.setrecursionlimit(1000000)
    # sys.stdin = open("sample.txt")
    T = Scanner.int()
    for _ in range(T):
        solve()


if __name__ == "__main__":
    main()
