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 sys
# sys.stdin = open('E:/Competitive Programming/input.txt', 'r')
# sys.stdout = open('E:/Competitive Programming/output.txt', 'w')
# sys.setrecursionlimit(1000000)
def Ints(): return map(int, sys.stdin.readline().strip().split())
def Strs(): return map(str, sys.stdin.readline().strip().split())
def Array(): return list(map(int, sys.stdin.readline().strip().split()))
def Str(): return sys.stdin.readline().strip()
def Int(): return int(sys.stdin.readline().strip())
def MOD(): return 1000000007    

def power(base, power):
    MOD = 1000000007
    result = 1
    while power > 0:
        if power % 2 == 1:
            result = (result * base) % MOD
        power = power // 2
        base = (base * base) % MOD
    return result

if __name__ == "__main__":
    t = Int()
    while t:
      n = Int()
      a = Array()

      positive = []
      negative = []

      for i in range(n):
        if a[i] < 0: 
          negative.append(a[i])
        else: 
          positive.append(a[i])

      positive = sorted(positive,reverse=True)
      negative = sorted(negative)
      # print(negative,positive)

      if(len(negative) + len(positive)) == 5: print(a[0] * a[1] * a[2] * a[3] * a[4])
      elif(len(negative) == 0):
        print(positive[0] * positive[1] * positive[2] *positive[3] * positive[4])
      elif(len(positive) == 0):
        print(negative[-1] * negative[-2] * negative[-3]* negative[-4] * negative[-5])    
      else:
        res = -float("inf")
        if(len(positive) >= 5):
          res = max(res,positive[0] * positive[1] * positive[2] * positive[3] * positive[4])
        if(len(negative) >= 4 and len(positive) >= 1):
          res = max(res,negative[0] * negative[1] * negative[2] * negative[3] * positive[0]) 
        if(len(negative) >= 3 and len(positive) >= 2):
          res = max(res,negative[0] * negative[1] * negative[2] * positive[0] * positive[1])
        if(len(negative) >= 2 and len(positive) >= 3):
          res = max(res,negative[0] * negative[1] * positive[0] * positive[1] * positive[2])
        if(len(negative) >= 1 and len(positive) >= 4):
          res = max(res,negative[0] * positive[0] * positive[1] * positive[2] * positive[3])
        if(len(negative) >= 5):
          res = max(res,negative[0] * negative[1] * negative[2] * negative[3] * negative[4])
        print(res)
      t -= 1

    
    